STACS 2005
From MaRDI portal
Publication:5710693
DOI10.1007/b106485zbMath1118.68525MaRDI QIDQ5710693
Georg Schnitger, Gregor Gramlich
Publication date: 2 December 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b106485
68Q45: Formal languages and automata
94A60: Cryptography
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
Transition Function Complexity of Finite Automata, Descriptional and computational complexity of finite automata -- a survey, Backward and forward bisimulation minimization of tree automata, Obtaining shorter regular expressions from finite-state automata, On the average state and transition complexity of finite languages, Minimizing nfa's and regular expressions, Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity, Descriptional and Computational Complexity of Finite Automata