Skip to main content
SpringerLink
Log in

Topological characterizations of infinite behaviours of transition systems

  • Conference paper
  • First Online:
Book cover Automata, Languages and Programming (ICALP 1983)

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

Included in the following conference series:

Abstract

Different kinds of infinite behaviours of different kind of transition systems are characterized by their topological properties.

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. A. Arnold. Rational Ω-languages are non ambiguous. To appear in Theor. Comput. Sci.

    Google Scholar 

  2. N. Bourbaki. Topologie générale, ch. IX., Hermann, Paris (1958).

    Google Scholar 

  3. S. Eilenberg. Automata, languages and machines, Vol. A. Academic Press, New York (1974).

    Google Scholar 

  4. L.H. Landweber. Decision problems for Ω-automata. Math. System Theory 3 (1969) 376–384.

    Google Scholar 

  5. M. Nivat, A. Arnold. Comportements de processus. in Colloque AFCET “Les mathématiques de l'Informatique”, Paris (1982) 35–68.

    Google Scholar 

  6. M. Takahashi, H. Yamasaki. A note on Ω-Regular languages. Report C-44. Tokyo Institute of Technology (1982).

    Google Scholar 

  7. K. Wisniewski. A notion of the acceptance of infinite sequences by finite automata. Bull. Acad. Pol. Sci. Math. 27(1979) 331–332.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire d'Informatique, Université de Poitiers and L.I.T.P., France

    André Arnold

Authors
  1. André Arnold
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Josep Diaz

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Arnold, A. (1983). Topological characterizations of infinite behaviours of transition systems. In: Diaz, J. (eds) Automata, Languages and Programming. ICALP 1983. Lecture Notes in Computer Science, vol 154. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0036895

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-12317-0

  • Online ISBN: 978-3-540-40038-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation