Descriptional Complexity of Bounded Regular Languages.

Andrea Herrmann Martin Kutrib Andreas Malcher Matthias Wendlandt

Published in: DCFS (2016)

Keyphrases

regular languages
decision problems
grammatical inference
context free languages
regular expressions
worst case
finite automata
database systems
computational complexity