Star normal form, rational expressions, and glushkov WFAs properties

Authors:
Pascal Caron;Marianne Flouret
Affiliations:
LIFAR, Université de Rouen, Cedex, France;LIH, Université du Havre, Le Havre Cedex, France
Venue:
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Year:
2002

Citing 8
Cited 1

Rational series and their languages

Rational series and their languages
Regular expressions into finite automata

Theoretical Computer Science
Partial derivatives of regular expressions and finite automaton constructions

Theoretical Computer Science
Characterization of Glushkov automata

Theoretical Computer Science
Automata, Languages, and Machines

Automata, Languages, and Machines
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
On the Determinization of Weighted Finite Automata

SIAM Journal on Computing
SEA: A Symbolic Environment for Automata Theory

WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation

From Glushkov WFAs to rational expressions

DLT'03 Proceedings of the 7th international conference on Developments in language theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we extend the characterisation of Glushkov automata to multiplicities. We consider automata obtained from rational expressions in star normal form. We show that for this class of automata, the graphical Boolean properties are preserved. We prove that this new characterization only depends on conditions on coefficients and we explicit these conditions.