Skip to main content
SpringerLink
Log in

On ω-power languages

  • 5. Infinite Words
  • Chapter
  • First Online:
New Trends in Formal Languages

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

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. J. Berstel and D. Perrin, Theory of Codes, Academic Press, Orlando 1985.

    Google Scholar 

  2. Y. Choueka, Theories of automata on ω-tapes: A simplified approach, J. Comput. System Sci. 8 (1974), 117–141.

    Google Scholar 

  3. R. S. Cohen and A. Y. Gold, ω-computations on deterministic push down machines, J. Comput. System Sci. (1978) 3, 257–300.

    Google Scholar 

  4. Ph. Darondeau and L. Kott, Towards a formal proof system for ω-rational expressions, Inform. Process. Letters 19 (1984), 173–177.

    Google Scholar 

  5. S. Eilenberg, Automata, Languages and Machines. Vol. A, Academic Press, New York 1974.

    Google Scholar 

  6. J.Engelfriet, H.J. Hoogeboom: X-automata on ω-words. Theoret. Comput. Sci. 110 (1993) 1, 1–51.

    Google Scholar 

  7. H. Izumi, Y. Inagaki and N. Honda, A complete axiomsystem of the algebra of closed rational expressions, in: Automata, Languages and Programming (ed. J. Paradaens), Lect. Notes Comput. Sci 172, Springer-Verlag, Berlin 1984, 260–269.

    Google Scholar 

  8. M. Linna, On ω-sets associated with context-free languages, Inform. Control 31 (1976) 3, 272–293.

    Google Scholar 

  9. M. Linna, A decidability result for deterministic ω-context-free languages, Theoret. Comput. Sci. 4 (1977), 83–98.

    Google Scholar 

  10. I. Litovsky, Generateurs des langages rationelles de mots infinis. Thèse, Univ. de Lille Flandres Artois 1988.

    Google Scholar 

  11. I. Litovsky, Prefix-free languages as ω-generators, Inform. Process. Letters 37 (1991) 1, 61–65.

    Google Scholar 

  12. I. Litovsky, Free submonoids and minimal ω-generators of R ω, Acta Cybernetica 10 (1991) 1–2, 35–43.

    Google Scholar 

  13. I. Litovsky and E. Timmerman, On generators of rational ω-power languages. Theoret. Comput. Sci. 53 (1987) 2/3, 187–200.

    Google Scholar 

  14. R. McNaughton, Testing and generating infinite sequences by a finite automaton, Inform. Control 9 (1966), 521–530.

    Google Scholar 

  15. D. Park, Concurrency and automata on infinite sequences, in: Theoret. Comput. Sci. (P. Deussen ed.), Lect. Notes Comput. Sci. 104, Springer-Verlag, Berlin 1981, 167–183.

    Google Scholar 

  16. D. Perrin, An introduction to finite automata on infinite words, in: Automata on Infinite Words (eds. M. Nivat and D. Perrin), Lect. Notes Comput. Sci. 192, Springer-Verlag, Berlin 1985, 1–17.

    Google Scholar 

  17. R.R. Redziejowski, The theory of general events and its application to parallel programming, Tech. paper TP 18.220, IBM Nordic Lab. Lidingö, Sweden, 1972.

    Google Scholar 

  18. A. Salomaa, Two complete axion systems for the algebra of regular events. J.ACM 13 (1966) 1, 158–169.

    Google Scholar 

  19. A. Salomaa, Jewels of Formal Language Theory, Computer Sci. Press, Rockville 1981.

    Google Scholar 

  20. L. Staiger, Reguläre Nullmengen. Elektron. Informationsverarb. Kybernetik EIK 12 (1976) 6, 307–311.

    Google Scholar 

  21. L. Staiger, Empty-storage-acceptance of ω-languages. in: Fundamentals of Computation Theory '77 (ed. M. Karpiński), Lect. Notes Comput. Sci. 56, Springer-Verlag, Berlin 1977, 516–521.

    Google Scholar 

  22. L. Staiger, A note on connected ω-languages. Elektron. Informationsverarb. Kybernetik EIK 16 (1980) 5/6, 245–251.

    Google Scholar 

  23. L. Staiger, Measure and category in 393-01. in: Topology and Measure II (eds. J. Flachsmeyer, Z. Frolik and F. Terpe) Part 2, Wiss. Beitr. Ernst-Moritz-Arndt-Universität Greifswald, 1980, 129–136.

    Google Scholar 

  24. L. Staiger, Finite-state ω-languages. J. Comput. System Sci. 27 (1983) 3, 434–448.

    Google Scholar 

  25. L. Staiger, On infinitary finite length codes. RAIRO Infor. théor. et Appl. 20 (1986) 4, 483–494.

    Google Scholar 

  26. L. Staiger, Sequential mappings of ω-languages. RAIRO Infor. théor. et Appl. 21 (1987) 2, 147–173.

    Google Scholar 

  27. L. Staiger, Research in the theory of ω-languages. J. Inform. Process. Cybernetics EIK 23 (1987) 8/9, 415–439.

    Google Scholar 

  28. W. Thomas, Automata on infinite objects, in: Handbook of Theoretical Comtputer Science (ed. J. Van Leeuwen), Vol. B, Elsevier, Amsterdam 1990, 133–191.

    Google Scholar 

  29. B.A. Trakhtenbrot, Finite automata and monadic second order logic. Siberian Math. J. 3 (1962), 103–131. (Russian; English translation in: AMS Transl. 59 (1966), 23–55.)

    Google Scholar 

  30. B.A. Trakhtenbrot and Ya.M. Barzdin, Finite Automata, Behaviour and Synthesis. Nauka Publishers, Moscow 1970. (Russian; English translation: North Holland, Amsterdam 1973)

    Google Scholar 

  31. K. Wagner, Eine Axiomatisierung der Theorie der regulären Folgenmengen. Elektron. Informationsverarb. Kybernetik EIK 12 (1976) 7, 337–354.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Martin-Luther-Universität Halle-Wittenberg, Kurt-Mothes-Str. 1, D-06099, Halle, Saale, Germany

    Ludwig Staiger

Authors
  1. Ludwig Staiger
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Gheorghe Păun Arto Salomaa

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Staiger, L. (1997). On ω-power languages. In: Păun, G., Salomaa, A. (eds) New Trends in Formal Languages. Lecture Notes in Computer Science, vol 1218. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62844-4_27

Download citation

  • DOI: https://doi.org/10.1007/3-540-62844-4_27

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62844-6

  • Online ISBN: 978-3-540-68703-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation