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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. Berstel and C. Reutenauer. Rational series and their languages. EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Berlin, 1988.
R. Book, S. Even, S. Greibach, and G. Ott. Ambiguity in graphs and expressions. IEEE Trans. Comput., c-20(2):149–153, 1971.
A. Brüggemann-Klein. Regular expressions into finite automata. Theoret. Comput. Sci., 120(1):197–213, 1993.
A. Buchsbaum, R. Giancarlo, and J. Westbrook. On the determinization of weighted finite automata. SIAM J. Comput., 30(5):1502–1531, 2000.
P. Caron and M. Flouret. Glushkov construction for series: the non commutative case. Internat. J. Comput. Math. To appear.
P. Caron and M. Flouret. Star normal form, rational expressions and glushkov WFAs properties. In Seventh International Conference on Implementation and Application of Automata, CIAA’02.
P. Caron and D. Ziadi. Characterization of Glushkov automata. Theoret. Comput. Sci., 233(1–2):75–90, 2000.
S. Eilenberg. Automata, languages and machines, volume A. Academic Press, New York, 1974.
K. Culik II and J. Kari. Digital images and formal languages. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, pages 599–616. svb, 1997.
S. Lombardy and J. Sakarovitch. Derivatives of regular expression with multiplicity. Technical Report 2001D001, ENST, Paris, 2001.
R.F. McNaughton and H. Yamada. Regular expressions and state graphs for automata. IEEE Transactions on Electronic Computers, 9:39–57, March 1960.
M. Mohri. Finite-state transducers in language and speech processing. Computat. Ling., 23.2:269–311, 1997.
F. Pereira and M. Riley. Speech recognition by composition of weighted finite automata. In E. Roche and Y. Schabes, editors, Finite state language processing, pages 431–453, Cambridge, Massachusetts, 1997. M.I.T. Press.
M.P. Schützenberger. On the definition of a family of automata. Inform. and Control, 4:245–270, 1961.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Caron, P., Flouret, M. (2003). From Glushkov WFAs to Rational Expressions. In: Ésik, Z., Fülöp, Z. (eds) Developments in Language Theory. DLT 2003. Lecture Notes in Computer Science, vol 2710. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45007-6_14
Download citation
DOI: https://doi.org/10.1007/3-540-45007-6_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40434-7
Online ISBN: 978-3-540-45007-8
eBook Packages: Springer Book Archive