From Glushkov WFAs to rational expressions

Authors:
Pascal Caron;Marianne Flouret
Affiliations:
LIFAR, Université de Rouen, Mont-Saint-Aignan Cedex, France;LIH, Université du Havre, Le Havre Cedex, France
Venue:
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Year:
2003

Citing 9
Cited 3

Rational series and their languages

Rational series and their languages
Regular expressions into finite automata

Theoretical Computer Science
Digital images and formal languages

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

Theoretical Computer Science
Automata, Languages, and Machines

Automata, Languages, and Machines
On the Determinization of Weighted Finite Automata

SIAM Journal on Computing
Finite-state transducers in language and speech processing

Computational Linguistics
Ambiguity in Graphs and Expressions

IEEE Transactions on Computers
Star normal form, rational expressions, and glushkov WFAs properties

CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata

Derivatives of rational expressions with multiplicity

Theoretical Computer Science
A play on regular expressions: functional pearl

Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
Implementing validated agents behaviours with automata based on goal decomposition trees

AOSE'05 Proceedings of the 6th international conference on Agent-Oriented Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we extend to the multiplicity case a characterization of Glushkov automata, and show the existence of a normal form for rational expressions. These results are used to obtain a rational expression of small size from a Glushkov WFA.