STACS 2005

DOI10.1007/b106485zbMath1118.68525OpenAlexW4230940848MaRDI QIDQ5710693

Gregor Gramlich, Georg Schnitger

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

zbMATH Keywords

Computational ComplexityApproximabilityAutomata and Formal Languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

Backward and forward bisimulation minimization of tree automata, Minimizing nfa's and regular expressions, Obtaining shorter regular expressions from finite-state automata, Forward Bisimulations for Nondeterministic Symbolic Finite Automata, On the average state and transition complexity of finite languages, Descriptional and computational complexity of finite automata -- a survey, Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity, Transition Function Complexity of Finite Automata, Descriptional and Computational Complexity of Finite Automata