Mathematical Foundations of Computer Science 2003

DOI10.1007/b11836zbMath1124.68381OpenAlexW2495578842MaRDI QIDQ5431333

Gregor Gramlich

Publication date: 7 December 2007

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

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (7)

Minimizing nfa's and regular expressions ⋮ Complexity of Promise Problems on Classical and Quantum Automata ⋮ On the Hardness of Determining Small NFA’s and of Proving Lower Bounds on Their Sizes ⋮ Nondeterministic syntactic complexity ⋮ Descriptional and computational complexity of finite automata -- a survey ⋮ Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity ⋮ Descriptional and Computational Complexity of Finite Automata

This page was built for publication: Mathematical Foundations of Computer Science 2003