You have Guest access.
Log In
Jonathan Lee and Jeffrey Shallit
Book Chapter
Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity
Markus Holzer and Martin Kutrib
Lecture Notes in Computer Science, 2008, Volume 5148, Implementation and Applications of Automata, Pages 1-16
On the Hardness of Determining Small NFA’s and of Proving Lower Bounds on Their Sizes
Juraj Hromkovič and Georg Schnitger
Lecture Notes in Computer Science, 2008, Volume 5257, Developments in Language Theory, Pages 34-55
Descriptional Complexity of Nondeterministic Finite Automata
Kai Salomaa
Lecture Notes in Computer Science, 2007, Volume 4588, Developments in Language Theory, Pages 31-35
On the State Complexity of Operations on Two-Way Finite Automata
Galina Jirásková and Alexander Okhotin
Lecture Notes in Computer Science, 2008, Volume 5257, Developments in Language Theory, Pages 443-454
Optimal Lower Bounds on Regular Expression Size Using Communication Complexity
Hermann Gruber and Jan Johannsen
Lecture Notes in Computer Science, 2008, Volume 4962, Foundations of Software Science and Computational Structures, Pages 273-286
Chop Operations and Expressions: Descriptional Complexity Considerations
Markus Holzer and Sebastian Jakobi
Lecture Notes in Computer Science, 2011, Volume 6795, Developments in Language Theory, Pages 264-275
Succinctness of Regular Expressions with Interleaving, Intersection and Counting
Wouter Gelade
Lecture Notes in Computer Science, 2008, Volume 5162, Mathematical Foundations of Computer Science 2008, Pages 363-374
Descriptional and Computational Complexity of Finite Automata
Lecture Notes in Computer Science, 2009, Volume 5457, Language and Automata Theory and Applications, Pages 23-42
Finite Automata, Palindromes, Powers, and Patterns
Terry Anderson, Narad Rampersad, Nicolae Santean and Jeffrey Shallit
Lecture Notes in Computer Science, 2008, Volume 5196, Language and Automata Theory and Applications, Pages 52-63
Computing by Observing Bio-systems: The Case of Sticker Systems
Artiom Alhazov and Matteo Cavaliere
Lecture Notes in Computer Science, 2005, Volume 3384, DNA Computing, Pages 711-717
Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us
© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info