Login / Signup
Maximal Syntactic Complexity of Regular Languages Implies Maximal Quotient Complexities of Atoms
Janusz A. Brzozowski
Gareth Davies
Published in:
CoRR (2013)
Keyphrases
</>
regular languages
decision problems
context free grammars
regular expressions
context free languages
special case
grammatical inference
finite automata
context free
database
worst case