Lower Bounds for the Transition Complexity of NFAs

DOI10.1007/11821069_28zbMath1132.68441MaRDI QIDQ5756712

Kai Salomaa, Michael Domaratzki

Publication date: 5 September 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11821069_28

Mathematics Subject Classification ID

68Q45: Formal languages and automata

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)