From regular expressions to deterministic automata
Theoretical Computer Science
Rational series and their languages
Rational series and their languages
AUTOMATE, a computing package for automata and finite semigroups
Journal of Symbolic Computation
Grail: a C++ library for automata and expressions
Journal of Symbolic Computation - Special issue on “algorithms: implementation, libraries and use”
Programming Techniques: Regular expression search algorithm
Communications of the ACM
Automata, Languages, and Machines
Automata, Languages, and Machines
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Finite State Transformations of Images
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Operations over Automata with Multiplicities
WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
SEA: A Symbolic Environment for Automata Theory
WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
Derivation of Rational Expressions with Multiplicity
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
The language, the expression, and the (small) automaton
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Fundamenta Informaticae
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
| Hi-index | 0.00 |
We present an extension to multiplicities of a classical algorithm for computing a boolean automaton from a regular expression. The Glushkov construction computes an automaton with n + 1 states from a regular expression with n occurences of letters. We show that the Glushkov algorithm still suits to the multiplicity case. Next, we give three equivalent extended step by step algorithms.