Operations on ω-regular languages

  • Andrzej Włodzimierz Mostowski
Section A Algebraic & Constructive Theory of Machines, Computations and Languages
Part of the Lecture Notes in Computer Science book series (LNCS, volume 56)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Buchi, J.R., On a decision method in restricted second order arithmetic. Logic, methodology and philosophy of science: Proc. 1960 Intern. Congr., p. 1–11 /Stanford Univ. Press, 1962/MR 32 7413.Google Scholar
  2. [2]
    Karpiński, M., Almost deterministic ω-automaton with exsistential output condition, Proc. Amer. Math. Soc. 53/1975/ p. 449–452.Google Scholar
  3. [3]
    Muller, D.E., Infinite sequences and finite machines. Swithing Circuit Theory and Logical Design, Proc. Fourth Am. Symp. p. 3–16 IEEE New York.Google Scholar
  4. [4]
    McNaughton, R., Testing and generating infinite sequences by a finite automaton. Information and Control 9 /1966/ p. 521–530. MR 35 4105.Google Scholar
  5. [5]
    Steiger, L., Wagner, K., Abstrakte familien von ω-sprachen /ω-AFL/. Tagungsbericht II Int. Symp. Algorithm Kompl. Lern u. Erkennungsproz. Jena 1976.Google Scholar
  6. [6]
    Trachtenbrot, B.A., Barzdin, Ja., Konecnyje awtomaty, Moskwa 1970, pp 400.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • Andrzej Włodzimierz Mostowski
    • 1
  1. 1.Mathematical Institute of the University of GdańskGdańskPoland

Personalised recommendations