Results 261 to 270 of about 697,927 (279)

Regular Languages are Testable with a Constant Number of Queries

SIAM Journal on Computing, 2001
Ilan Newman, Mario Szegedy
exaly  

On Decidability of Theories of Regular Languages

Theory of Computing Systems, 2020
S M Dudakov, Boris Karlov
exaly  

State complexity of basic operations on suffix-free regular languages

Theoretical Computer Science, 2009
Yo-Sub Han, Kai Salomaa
exaly  

Regular tree languages definable in FO and in FO mod

ACM Transactions on Computational Logic, 2009
Michael Benedikt, Luc Segoufin
exaly  

Local Languages, the Succesor Method, and a Step Towards a General Methodology for the Inference of Regular Grammars

IEEE Transactions on Pattern Analysis and Machine Intelligence, 1987
Francisco Casacuberta
exaly  

Learning regular languages using RFSAs

Theoretical Computer Science, 2004
François Denis, Alain Terlutte
exaly  

Inferring uniquely terminating regular languages from positive data

Information Processing Letters, 1997
Erkki Mäkinen
exaly  

Characterising REGEX languages by regular languages equipped with factor-referencing

Information and Computation, 2016
Markus L Schmid
exaly  

A note on equations for commutative regular languages

Information Processing Letters, 1999
Siniša Crvenkovic, Igor Dolinka, Zoltan Ésik   +2 more
exaly  

Commutative regular languages

ACM SIGACT News, 1991
openaire   +1 more source