Skip to main content
SpringerLink
Log in
Book cover

International Colloquium on Automata, Languages, and Programming

ICALP 1989: Automata, Languages and Programming pp 289–303Cite as

Automata with storage on infinite words

  • Conference paper
  • First Online:

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

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Arnold, Topological characterizations of infinite behaviours of transition systems, LNCS 154 (1983) 28–38 Springer Verlag, Berlin.

    Google Scholar 

  2. L. Boasson & N. Nivat, Adherences of languages, J. Comput. System Sci. 20 (1980) 285–309.

    Article  Google Scholar 

  3. J.R. Büchi, On a decision method in restricted second order arithmetic, in: Proc. Int. Congr. Logic, Methodology and Philosophy of Sciences 1960, Stanford University Press, Stanford, CA, 1962.

    Google Scholar 

  4. H. Carstensen, Fairness in deadlockfree Petri nets with the finite delay property, Proc 5th European Workshop on appl. and theory of Petri nets, Aarhus, 1984, pp. 234–253.

    Google Scholar 

  5. H. Carstensen, Infinite behaviour of deterministic Petri nets, LNCS 324 (1988) 210–219 Springer Verlag, Berlin.

    Google Scholar 

  6. R.S. Cohen, A.Y. Gold, Theory of ω-languages. II: A study of various models of ω-type generation and recognition, J. Comput. System Sci. 15 (1977) 185–208.

    Google Scholar 

  7. R.S. Cohen, A.Y. Gold, ω-Computations on deterministic pushdown machines, J. Comput. System Sci. 16 (1978) 275–300.

    Article  Google Scholar 

  8. R.S. Cohen, A.Y. Gold, ω-Computations on Turing machines, Theor. Comput. Sci. 6 (1978) 1–23.

    Article  Google Scholar 

  9. J. Engelfriet, H. Vogler, Look-ahead on pushdowns, Inform. and Computation 73 (1987) 245–279.

    Article  Google Scholar 

  10. S. Ginsburg, Algebraic and automata-theoretic properties of formal languages, 1975, North-Holland/American Elsevier, Amsterdam/New York.

    Google Scholar 

  11. S.A. Greibach, Remarks on blind and partially blind one-way multicounter machines, Theor. Comput. Sci. 7 (1978) 311–324.

    Article  Google Scholar 

  12. R. Hossley, Finite tree automata and ω-automata, MAC Technical report 102 MIT, summer 1972.

    Google Scholar 

  13. M. Jantzen, On the hierarchy of Petri net Languages, RAIRO Inf. Théor. 13 (1979) 19–30.

    Google Scholar 

  14. L.H. Landweber, Decision problems for ω-automata, Math. Systems Theor. 3 (1969) 376–384.

    Article  Google Scholar 

  15. M. Latteux, E. Timmerman, Two characterizations of rational adherences, Theor. Comput. Sci. 46 (1986) 101–106.

    Article  Google Scholar 

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

    Article  Google Scholar 

  17. D.E. Muller, Infinite sequences and finite machines, AIEE Proc. 4th ann. symp. switch. circ. th. and log. design, 1963, pp.3–16.

    Google Scholar 

  18. L. Staiger, Empty-storage-acceptance of ω-languages, LNCS 56 (1977) 516–521, Springer Verlag, Berlin.

    Google Scholar 

  19. L. Staiger, Projection lemmas for ω-languages, Theor. Comput. Sci. 32 (1984) 331–337.

    Article  Google Scholar 

  20. L. Staiger, Research in the theory of ω-languages, EIK 23 (1987) 415–439.

    Google Scholar 

  21. L. Staiger, K. Wagner, Automatentheoretische und automatenfreie Characterisierungen topologischer Klassen regulaerer Folgenmengen, EIK 10 (1974) 379–392.

    Google Scholar 

  22. R. Valk, Infinite behaviour of Petri nets, Theor. Comput. Sci. 25 (1983) 311–341.

    Article  Google Scholar 

  23. K. Wagner, On ω-regular sets, Inform. and Control 43 (1979) 123–177.

    Article  Google Scholar 

  24. K. Wagner, L. Staiger, Recursive ω-languages, LNCS 56 (1977) 532–537, Springer Verlag, Berlin, see also: Rekursive Folgenmengen I, Zeitschr. math. Logik Grundlagen Math., 24 (1978) 523–528.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Leiden University, P.O. Box 9512, 2300 RA, Leiden, The Netherlands

    Joost Engelfriet & Hendrik Jan Hoogeboom

Authors
  1. Joost Engelfriet
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hendrik Jan Hoogeboom
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Giorgio Ausiello Mariangiola Dezani-Ciancaglini Simonetta Ronchi Della Rocca

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Engelfriet, J., Hoogeboom, H.J. (1989). Automata with storage on infinite words. In: Ausiello, G., Dezani-Ciancaglini, M., Della Rocca, S.R. (eds) Automata, Languages and Programming. ICALP 1989. Lecture Notes in Computer Science, vol 372. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0035767

Download citation

  • DOI: https://doi.org/10.1007/BFb0035767

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51371-1

  • Online ISBN: 978-3-540-46201-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation