Back to Search
Start Over
An Efficient Computation of the Equation K-automaton of a Regular K-expression.
- Source :
-
Fundamenta Informaticae . 2009, Vol. 90 Issue 1-2, p1-16. 16p. 3 Diagrams. - Publication Year :
- 2009
-
Abstract
- The aim of this paper is to describe a quadratic algorithm for computing 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. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 01692968
- Volume :
- 90
- Issue :
- 1-2
- Database :
- Academic Search Index
- Journal :
- Fundamenta Informaticae
- Publication Type :
- Academic Journal
- Accession number :
- 36611496
- Full Text :
- https://doi.org/10.3233/fi-2009-0001