Descriptional Complexity of Bounded Regular Languages.

Andrea Herrmann Martin Kutrib Andreas Malcher Matthias Wendlandt

Published in: J. Autom. Lang. Comb. (2017)

Keyphrases

regular languages
decision problems
regular expressions
context free languages
grammatical inference
finite automata
boolean functions
positive data
databases
computational complexity
context free grammars