Skip to main content
SpringerLink
Log in
Book cover

International Conference on Developments in Language Theory

DLT 2003: Developments in Language Theory pp 183–193Cite as

From Glushkov WFAs to Rational Expressions

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2710))

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.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Berstel and C. Reutenauer. Rational series and their languages. EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Berlin, 1988.

    Google Scholar 

  2. R. Book, S. Even, S. Greibach, and G. Ott. Ambiguity in graphs and expressions. IEEE Trans. Comput., c-20(2):149–153, 1971.

    Article  MathSciNet  Google Scholar 

  3. A. Brüggemann-Klein. Regular expressions into finite automata. Theoret. Comput. Sci., 120(1):197–213, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  4. A. Buchsbaum, R. Giancarlo, and J. Westbrook. On the determinization of weighted finite automata. SIAM J. Comput., 30(5):1502–1531, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  5. P. Caron and M. Flouret. Glushkov construction for series: the non commutative case. Internat. J. Comput. Math. To appear.

    Google Scholar 

  6. 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.

    Google Scholar 

  7. P. Caron and D. Ziadi. Characterization of Glushkov automata. Theoret. Comput. Sci., 233(1–2):75–90, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  8. S. Eilenberg. Automata, languages and machines, volume A. Academic Press, New York, 1974.

    MATH  Google Scholar 

  9. 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.

    Google Scholar 

  10. S. Lombardy and J. Sakarovitch. Derivatives of regular expression with multiplicity. Technical Report 2001D001, ENST, Paris, 2001.

    Google Scholar 

  11. R.F. McNaughton and H. Yamada. Regular expressions and state graphs for automata. IEEE Transactions on Electronic Computers, 9:39–57, March 1960.

    Article  Google Scholar 

  12. M. Mohri. Finite-state transducers in language and speech processing. Computat. Ling., 23.2:269–311, 1997.

    MathSciNet  Google Scholar 

  13. 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.

    Google Scholar 

  14. M.P. Schützenberger. On the definition of a family of automata. Inform. and Control, 4:245–270, 1961.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIFAR, Université de Rouen, 76134, Mont-Saint-Aignan Cedex, France

    Pascal Caron

  2. LIH, Université du Havre, 76058, Le Havre Cedex, France

    Marianne Flouret

Authors
  1. Pascal Caron
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marianne Flouret
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Informatics, University of Szeged, Árpád tér 2, 6720, Szeged, Hungary

    Zoltán Ésik  & Zoltán Fülöp  & 

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation