Deterministic and non ambiguous rational ω-languages

  • André Arnold
Part I The Theory Of Buchi And McNaughton
Part of the Lecture Notes in Computer Science book series (LNCS, volume 192)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    A. Arnold. Rational ω-languages are non-ambiguous (Note). Theoret. Comput. Sci. 26 (1983) 221–223.Google Scholar
  2. 2.
    A. Arnold. Topological characterizations of infinite behaviours of transition systems. in "Automata, Languages and Programming", 10th Colloquium, Barcelona, 1983 (J. Diaz, ed), LNCS 154 (1983) 28–38.Google Scholar
  3. 3.
    S. Eilenberg. Automata, Languages and Machines. Vol. A, Academic Press, New-York (1974).Google Scholar
  4. 4.
    K. Kuratowski. Topology I. Academic Press, New-York (1966).Google Scholar
  5. 5.
    L.H. Landweber. Decision problems for ω-automata. Math. System Theor. 3 (1969) 376–384.Google Scholar
  6. 6.
    L. Staiger. Finite-State ω-languages. J. Comput. System Sci. 27 (1983) 434–448.Google Scholar
  7. 7.
    L. Staiger, K. Wagner. Automaton theoretische und automatonfreie charakterisierungen topologischer Klassen regulärer Folgenmangen. EIK 10 (1974) 379–392.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • André Arnold
    • 1
  1. 1.Université de PoitiersFrance

Personalised recommendations