Results 251 to 260 of about 52,651 (265)
Some of the next articles are maybe not open access.
Nondeterministic state complexity of star-free languages
Theoretical Computer Science, 2012Martin Kutrib, Markus Holzer
exaly
Some Applications of the Formalization of the Pumping Lemma for Context-Free Languages
Electronic Notes in Theoretical Computer Science, 2019Nelma Moreira, Ruy De Queiroz
exaly
Extensions of sokolowski's theorem to prove languages are not context free or not regular
International Journal of Computer Mathematics, 1982Philip W Grant
exaly
Growth of Power-Free Languages over Large Alphabets
Theory of Computing Systems, 2013Shur Arseny M, Arseny M Shur
exaly
Computation of distances for regular and context-free probabilistic languages
Theoretical Computer Science, 2008Giorgio Satta, Mark-Jan Nederhof
exaly
Epsilon-reducible context-free languages and characterizations of indexed languages
Information and Computation, 2019exaly