Handbook of theoretical computer science (vol. B)
AUTOMATE, a computing package for automata and finite semigroups
Journal of Symbolic Computation
Computability, complexity, and languages (2nd ed.): fundamentals of theoretical computer science
Computability, complexity, and languages (2nd ed.): fundamentals of theoretical computer science
Grail: a C++ library for automata and expressions
Journal of Symbolic Computation - Special issue on “algorithms: implementation, libraries and use”
Partial derivatives of regular expressions and finite automaton constructions
Theoretical Computer Science
Handbook of formal languages, vol. 1
Characterization of Glushkov automata
Theoretical Computer Science
Theory of Computation: A Primer
Theory of Computation: A Primer
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
A New Quadratic Algorithm to Convert a Regular Expression into an Automaton
WIA '96 Revised Papers from the First International Workshop on Implementing Automata
Instruction Computation in Subset Construction
WIA '96 Revised Papers from the First International Workshop on Implementing Automata
An Efficient Null-Free Procedure for Deciding Regular Language Membership
WIA '97 Revised Papers from the Second International Workshop on Implementing Automata
Finite automata and their decision problems
IBM Journal of Research and Development
Implicit Structures to Implement NFA's from Regular Expressions
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
On the Size of Deterministic Finite Automata
CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata
Block-Deterministic Regular Languages
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
| Hi-index | 0.00 |
We establish a new upper bound on the number of states of the automaton yielded by the determinization of a Glushkov automaton. We show that the ZPC structure, which is an implicit construction for Glushkov automata, leads to an efficient implementation of the subset construction.