Skip to main content
SpringerLink
Log in

Star Height of Reversible Languages and Universal Automata

  • Conference paper
  • First Online:
LATIN 2002: Theoretical Informatics (LATIN 2002)

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

Included in the following conference series:

Abstract

The star height of a regular language is an invariant that has been shown to be effectively computable in 1988 by Hashiguchi. But the algorithm that corresponds to his proof leads to impossible computations even for very small instances. Here we solve the problem (of computing star height) for a special class of regular languages, called reversible languages, that have attracted much attention in various areas of formal language and automata theory in the past few years. These reversible languages also strictly extend the classes of languages considered by McNaughton, Cohen, and Hashiguchi for the same purpose, and with different methods.

Our method is based upon the definition (inspired by the reading of Conway’s book) of an automaton that is effectively associated to every language — which we call the universal automaton of the language — and that contains the image of any automaton that accepts the language. We show that the universal automaton of a reversible language contains a subautomaton where the star height can be computed.

Regular languages are closed under complement but complement is not considered as a regular operation.

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. Arnold A., Dicky A., and Nivat M., A Note about Minimal Non-deterministic Automata. Bull. of E.A.T.C.S.47 (1992), 166–169.

    MATH  Google Scholar 

  2. Büchi J. R., Finite Automata, their Algebras and Grammars: Toward a Theory of formal Expressions. D. Siefkes Ed.. Springer-Verlag, 1989.

    Google Scholar 

  3. Cohen R., Star height of certain families of regular events. J. Computer System Sci.4 (1970), 281–297.

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

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

    Google Scholar 

  6. Dejean F. and Schützenberger M. P., On a question of Eggan. Inform. and Control9 (1966), 23–25.

    Article  MathSciNet  Google Scholar 

  7. Eggan L. C., T ransition graphs and the star-height of regular events. Michigan Mathematical J.10 (1963), 385–397.

    Article  MathSciNet  Google Scholar 

  8. Eilenberg S., Automata, Languages and Machines vol. A, A cademic Press, 1974.

    Google Scholar 

  9. Hashiguchi K., The star height of reset-free events and strictly locally testable events. Inform. and Control40 (1979), 267–284.

    Article  MathSciNet  Google Scholar 

  10. K. Hashiguchi, Algorithms for determining relative star height and star height. Inform. and Computation 78 (1988), 124–169.

    Article  MathSciNet  Google Scholar 

  11. Lombardy S., On the construction of reversible automata for reversible languages, submitted.

    Google Scholar 

  12. Lombardy S. and Sakarovitch J., On the star height of rational languages: a new version for two old results, Proc. 3rd Int. Col. on Words, Languages and Combinatorics, (M. Ito, Ed.) World Scientific, to appear. Available at the URL: http://www.enst.fr/~jsaka.

  13. Héam P.-C., Some topological properties of rational sets. J. of Automata, Lang. and Comb., to appear.

    Google Scholar 

  14. McNaughton R., The loop complexity of pure-group events. Inform. and Control 11 (1967), 167–176.

    Article  MathSciNet  Google Scholar 

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

    Google Scholar 

  16. Sakarovitch J., Eléments de théorie des automates. Vuibert, to appear.

    Google Scholar 

  17. Salomaa A., Jewels of formal language theory. Computer Science Press, 1981.

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Sylvain Lombardy & Jacques Sakarovitch

Authors
  1. Sylvain Lombardy
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jacques Sakarovitch
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Compaq Cambridge Research Laboratory, One Cambridge Center, 02142-1612, Cambridge, MA, USA

    Sergio Rajsbaum

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lombardy, S., Sakarovitch, J. (2002). Star Height of Reversible Languages and Universal Automata. In: Rajsbaum, S. (eds) LATIN 2002: Theoretical Informatics. LATIN 2002. Lecture Notes in Computer Science, vol 2286. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45995-2_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-45995-2_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45995-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation