Skip to main content
SpringerLink
Log in

On the minimization problem for ω-automata

  • Contributions
  • Conference paper
  • First Online:
Book cover Mathematical Foundations of Computer Science 1994 (MFCS 1994)

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

  • 145 Accesses

Abstract

The family of rational ω-languages which are accepted by a unique minimal ω-automaton — using deterministic automaton morphism reductions — is characterized. All the other rational ω-languages have an infinite number of minimal ω-automata.

Reseach on this paper was supported by ESPRIT-BRA working group ASMICS

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Do Long Van, B. Le Saëc, I. Litovsky, “A Syntactic Approach To Deterministic ω-Automata”, in Théorie des Automates et Applications (D. Krob ed.) Actes des Deuxièmes Journées Franco-Belges. Rouen (1991) 133–146.

    Google Scholar 

  2. S. Eilenberg “Automata, Languages And Machines” Vol.A (1974) and Vol.B (1976) Accademic Press New York.

    Google Scholar 

  3. B. Le Saëc “Saturating Right Congruences for Rational ω-Languages” R.A.I.R.O. Inform. Theor. Appl. 24 (1990) 545–560.

    Google Scholar 

  4. B. Le Saëc, J.E. Pin, P. Weil, “Finite semigroup whose stabilizers are idempotent”, International Journal of Algebra and Computation, Vol 1, N∘3 (1991) 291–314.

    Google Scholar 

  5. O. Maler, L. Staiger “On Syntactic Congruences For ω-languages” STACS'93, LNCS vol. 665, To appear.

    Google Scholar 

  6. R. McNaughton “Testing And Generating Infinite Sequences By Finite Automaton.” Inform. Control 9, (1966) 521–30.

    Google Scholar 

  7. D. Müller “Infinite Sequences And Finite Machines” Switching Theory and Logical Design, (Proc. 4th IEEE Symp.), (1963) 3–16.

    Google Scholar 

  8. S. Safra “On The Complexity Of ω-Automata” 29th Annual Symposium on Foundation of computer sciences, (1988) 24–29.

    Google Scholar 

  9. L. Staiger “Finite-state ω-languages” J. Computation. Sys. Sci. 27, (1983) 434–448.

    Google Scholar 

  10. A. Trachenbrot “Finite Automata And The Logic Of One-Place Predicates” Siberian Math. J. 3(1) (1962) 103–131.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire Bordelais de Recherche en Informatique, 351 cours de la Libération, 33405, Talence Cedex, France

    Bertrand Le Saëc

  2. ESSI, Routes des colles, BP 145, 06903, Sophia Antipolis, France

    Igor Litovsky

Authors
  1. Bertrand Le Saëc
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Igor Litovsky
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Igor Prívara Branislav Rovan Peter Ruzička

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Le Saëc, B., Litovsky, I. (1994). On the minimization problem for ω-automata. In: Prívara, I., Rovan, B., Ruzička, P. (eds) Mathematical Foundations of Computer Science 1994. MFCS 1994. Lecture Notes in Computer Science, vol 841. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58338-6_97

Download citation

  • DOI: https://doi.org/10.1007/3-540-58338-6_97

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58338-7

  • Online ISBN: 978-3-540-48663-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation