Skip to main content
SpringerLink
Log in

Some results about finite and infinite behaviours of a pushdown automaton

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1984)

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

Included in the following conference series:

Abstract

We are interested in infinitary languages recognized by a pushdown automaton. We, then, give theorems of characterization of such closed, central, normal or perfect languages (considering a number of hypothesis of continuity in computations of the automaton, for last three classes). Besides, it is proved that, given the same hypothesis, the largest central (respectively normal, perfect, language included in an algebraic infinitary language, remains algebraic.

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 and M. Nivat, Comportements de processus, Colloque AFCET, Les Mathématiques de l'Informatique, Paris (1982), p. 35–68.

    Google Scholar 

  2. R. Cohen and A. Gold, Theory of ω-languages, Jour. Comp. Syst. Sci. Vol. 15 (1977), p. 169–184.

    Google Scholar 

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

    Google Scholar 

  4. M.A. Harrison, Introduction to formal language theory, Addison Wesley (1969).

    Google Scholar 

  5. R. McNaughton, Testing and generating infinite sequences by a finite automaton, Inf. and Control, Vol. 9 (1966), p. 521–530.

    Google Scholar 

  6. M. Nivat, Behaviours of synchronized systems of processes, Cours de D.E.A. 1981–82, L.I.T.P., Paris VII.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Université Paris VII UER de Mathématiques, 2, Place Jussieu, 75251, PARIS CEDEX 05, FRANCE

    Danièle Girault-Beauquier

Authors
  1. Danièle Girault-Beauquier
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jan Paredaens

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Girault-Beauquier, D. (1984). Some results about finite and infinite behaviours of a pushdown automaton. In: Paredaens, J. (eds) Automata, Languages and Programming. ICALP 1984. Lecture Notes in Computer Science, vol 172. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-13345-3_17

Download citation

  • DOI: https://doi.org/10.1007/3-540-13345-3_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13345-2

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation