Skip to main content
SpringerLink
Log in

On the Construction of Reversible Automata for Reversible Languages

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 2002)

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

Included in the following conference series:

Abstract

Reversible languages occur in many different domains. Although the decision for the membership of reversible languages was solved in 1992 by Pin, an effective construction of a reversible automaton for a reversible language was still unknown. We give in this paper a method to compute a reversible automaton from the minimal automaton of a reversible language. With this intention, we use the universal automaton of the language that can be obtained from the minimal automaton and that contains an equivalent automaton which is quasi-reversible. This quasi-reversible automaton has nearly the same properties as a reversible one and can easily be turned into a reversible automaton.

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

Access this chapter

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Arnold, A. Dicky, AND M. Nivat, A note about minimal non-deterministic automata. Bull. of E.A.T.C.S. 47 (1992), 166–169.

    Google Scholar 

  2. C. J. Ash, Finite semigroups with commuting idempotents, J. Austral. Math. Soc. (Series A) 43 (1987), 81–90.

    MATH  MathSciNet  Google Scholar 

  3. R. S. Cohen AND J. A. Brzozowski, General properties of star height of regular events, J. Computer System Sci. 4 (1970), 260–280.

    MATH  MathSciNet  Google Scholar 

  4. J. H. Conway, Regular algebra and finite machines, Chapman and Hall, 1971.

    Google Scholar 

  5. P.-C. Héam, A lower bound for reversible automata, Theoret. Informatics Appl. 34 (2000), 331–341.

    Article  MATH  Google Scholar 

  6. P.-C. Héam, Some topological properties of rational sets, J. of Automata, Lang, and Comb. 6 (2001), 275–290.

    MATH  MathSciNet  Google Scholar 

  7. S. Lombardy and J. Sakarovitch, Star height of reversible languages and universal automata, Proc. 5th Latin Conf., (S. Rajsbaum, Ed.), Lecture Notes in Comput. Sci. 2286 (2002).

    Google Scholar 

  8. O. Matz AND A. Potthoff, Computing small nondeterministic finite automata. Proc. TACAS’95, BRICS Notes Series (1995), 74–88.

    Google Scholar 

  9. C. Nicaud, Étude du comportement en moyenne des automates finis et des lan-gages rationnels, Thèse de doctorat, Université Paris 7, 2000.

    Google Scholar 

  10. J.-E. Pin, On reversible automata, Proc. 1st LATIN Conf., (I. Simon, Ed.), Lecture Notes in Comput. Sci. 583 (1992), 401–416.

    Google Scholar 

  11. J.-E. Pin, A variety theorem without complementation, Russian mathematics 39 (1995), 80–90.

    MathSciNet  Google Scholar 

  12. J. Sakarovitch, Éléments de théorie des automates, Vuibert, to appear.

    Google Scholar 

  13. P.V. Silva, On free inverse monoid languages, Theoret. Informatics and Appl. 30 (1996), 349–378.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire Traitement et Communication de l’Information, Ecole Nationale Supérieure des Télécommunications, 46, rue Barrault, 75634, Paris Cedex 13, France

    Sylvain Lombardy

Authors
  1. Sylvain Lombardy
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Theoretical Computer Science, ETH Zentrum, ETH Zürich, 8092, Zürich, Switzerland

    Peter Widmayer  & Stephan Eidenbenz  & 

  2. Department of Languages and Sciences of the Computation E.T.S. de Ingeniería Informática, University of Málaga, Campus de Teatinos, 29071, Málaga, Spain

    Francisco Triguero , Rafael Morales  & Ricardo Conejo ,  & 

  3. School of Cognitive and Computing Sciences, University of Sussex, Falmer, Brighton, BN1 9QN, UK

    Matthew Hennessy

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lombardy, S. (2002). On the Construction of Reversible Automata for Reversible Languages. In: Widmayer, P., Eidenbenz, S., Triguero, F., Morales, R., Conejo, R., Hennessy, M. (eds) Automata, Languages and Programming. ICALP 2002. Lecture Notes in Computer Science, vol 2380. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45465-9_16

Download citation

  • DOI: https://doi.org/10.1007/3-540-45465-9_16

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43864-9

  • Online ISBN: 978-3-540-45465-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation