Results 271 to 280 of about 1,782,235 (292)
Some of the next articles are maybe not open access.
Regular Languages are Testable with a Constant Number of Queries
SIAM Journal on Computing, 2001Ilan Newman, Mario Szegedy
exaly
Characterising REGEX languages by regular languages equipped with factor-referencing
Information and Computation, 2016Markus L Schmid
exaly
State complexity of some operations on binary regular languages
Theoretical Computer Science, 2005Galina Jirásková
exaly
Inferring uniquely terminating regular languages from positive data
Information Processing Letters, 1997Erkki Mäkinen
exaly
A note on equations for commutative regular languages
Information Processing Letters, 1999Igor Dolinka +2 more
exaly
State complexity of basic operations on suffix-free regular languages
Theoretical Computer Science, 2009Yo-Sub Han, Kai Salomaa
exaly
Regular and context-free pattern languages over small alphabets
Theoretical Computer Science, 2014Markus L Schmid, Daniel Reidenbach
exaly
Learning regular languages using RFSAs
Theoretical Computer Science, 2004François Denis, Alain Terlutte
exaly