An efficient computation of the equation K-automaton of a regular K-expression

Authors:
Jean-Marc Champarnaud;Faissal Ouardi;Djelloul Ziadi
Affiliations:
LITIS, University of Rouen, France, Mont-Saint-Aignan, France;LITIS, University of Rouen, France, Mont-Saint-Aignan, France;LITIS, University of Rouen, France, Mont-Saint-Aignan, France
Venue:
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Year:
2007

Citing 12
Cited 2

Semirings, automata, languages

Semirings, automata, languages
Regular expressions into finite automata

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

Theoretical Computer Science
From regular expressions to DFA's using compressed NFA's

Theoretical Computer Science
Programming Techniques: Regular expression search algorithm

Communications of the ACM
Canonical derivatives, partial derivatives and finite automaton constructions

Theoretical Computer Science
Derivation of Rational Expressions with Multiplicity

MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Follow automata

Information and Computation
Derivatives of rational expressions with multiplicity

Theoretical Computer Science
From Mirkin's Prebases to Antimirov's Word Partial Derivatives

Fundamenta Informaticae
A unified construction of the glushkov, follow, and antimirov automata

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Inside vaucanson

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

An Efficient Computation of the Equation K-automaton of a Regular K-expression

Fundamenta Informaticae
An Efficient Computation of the Equation K-automaton of a Regular K-expression

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

The aim of this paper is to describe a quadratic algorithm to compute the equation K-automaton of a regular K-expression as defined by Lombardy and Sakarovitch. Our construction is based on an extension to regular K-expressions of the notion of c-continuation that we introduced to compute the equation automaton of a regular expression as a quotient of its position automaton.