Complexity of bifix-free regular languages.

Robert Ferens Marek Szykula

Published in: Theor. Comput. Sci. (2019)

Keyphrases

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