Login / Signup
Towards a Theory of Complexity of Regular Languages.
Janusz A. Brzozowski
Published in:
J. Autom. Lang. Comb. (2018)
Keyphrases
</>
regular languages
decision problems
grammatical inference
context free languages
regular expressions
worst case
computational complexity
finite automata
computational model
learning algorithm
lower bound
active learning
data management
context sensitive