A New Family of Regular Operators Fitting with the Position Automaton Computation

Authors:
Pascal Caron;Jean-Marc Champarnaud;Ludovic Mignot
Affiliations:
LITIS, University of Rouen, France;LITIS, University of Rouen, France;LITIS, University of Rouen, France
Venue:
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Year:
2009

Citing 9
Cited 3

Regular expression for a language without empty word

Theoretical Computer Science
Regular languages

Handbook of formal languages, vol. 1
Characterization of Glushkov automata

Theoretical Computer Science
Translating regular expressions into small εe-free nondeterministic finite automata

Journal of Computer and System Sciences
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Follow automata

Information and Computation
Regular expressions: new results and open problems

Journal of Automata, Languages and Combinatorics
Approximation to the smallest regular expression for a given regular language

CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
The language, the expression, and the (small) automaton

CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata

Multi-tilde Operators and Their Glushkov Automata

LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Small Extended Expressions for Acyclic Automata

CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Acyclic automata and small expressions using multi-tilde-bar operators

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The aim of this paper is to define a new family of regular operators fitting with the construction of the position automaton. These new operators support the computation of the four Glushkov functions (Null, First, Last and Follow), which allows the conversion of an extended expression with n symbol occurrences into a position automaton with n + 1 states.