Mathematical Foundations of Computer Science 2003
From MaRDI portal
Publication:5431333
DOI10.1007/b11836zbMath1124.68381MaRDI QIDQ5431333
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
68Q45: Formal languages and automata
Related Items
Descriptional and computational complexity of finite automata -- a survey, Nondeterministic syntactic complexity, 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 Finite Automata—Recent Results on the Descriptional and Computational Complexity, Descriptional and Computational Complexity of Finite Automata