Skip to main content
SpringerLink
Log in

Sets of Infinite Words Recognized by Deterministic One-Turn Pushdown Automata

  • Conference paper
Infinity in Logic and Computation (ILC 2007)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5489))

Included in the following conference series:

  • 223 Accesses

Abstract

In this paper we consider deterministic pushdown automata on infinite words with restricted use of the stack. More precisely, this study concerns: (1) Behavior of deterministic one-turn pushdown automata using Büchi and Muller modes of acceptance and (2) Closure properties of these sets by Boolean and limit operators.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Büchi, J.R.: On a decision method in the restricted second-order arithmetic. In: Logic, methodology and philosophy of science. Proceedings of the 1960 International Congress, pp. 1–14. Stanford Univ. Press, CA (1962)

    Google Scholar 

  2. Cohen, R., Gold, A.: Theory of ω-languages, I, II. J. Comp. System Sci. 15, 169–208 (1977)

    MATH  MathSciNet  Google Scholar 

  3. Cohen, R., Gold, A.: ω-computation on deterministic pushdown machines. J. Comp. System Sci. 16, 275–300 (1978)

    Google Scholar 

  4. Eilenberg, S.: Automata languages and machines, vol. A. Academic press, New York (1977)

    Google Scholar 

  5. Linna, M.: On ω-words and ω-computations, Ann. Univ. Turkuensis (1975)

    Google Scholar 

  6. Ginsburg, S., Spanier, E.: Finite-turn pushdown automata. SIAM J. Control (4), 429–453 (1966)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  8. Mihoubi, D.: Characterization and closure properties of linear ω-languages. Theor. Comput. Sci. 191, 79–95 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  9. Mihoubi, D.: Modes de reconnaissance et equités dans les ω-automates à pic, Thèse de Doctorat, Université Paris Nord (1989)

    Google Scholar 

  10. Muller, D.: Infinite sequences and finite machines. In: Ginsburg, S. (ed.) SWCT 1963, pp. 3–16. IEEE, Los Alamitos (1963)

    Google Scholar 

  11. Nivat, M.: Sur les ensembles de mots infinis engendrés par une grammaire algèbrique. Inform. Théorique et Appl. 12(3), 259–278 (1978)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire des Mathématiques Pures et Appliquées, Département de Mathématique, Université de M’sila, Algeria

    Douadi Mihoubi

Authors
  1. Douadi Mihoubi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics and Applied Mathematics, University of Cape Town, 7701, Rondebosch, South Africa

    Margaret Archibald  & Vasco Brattka  & 

  2. School of Mathematics, University of the Witwatersrand, Johannesburg, South Africa

    Valentin Goranko

  3. Institute for Logic, Language and Computation, Universiteit van Amsterdam, 1090, Amsterdam, GE, The Netherlands

    Benedikt Löwe

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mihoubi, D. (2009). Sets of Infinite Words Recognized by Deterministic One-Turn Pushdown Automata. In: Archibald, M., Brattka, V., Goranko, V., Löwe, B. (eds) Infinity in Logic and Computation. ILC 2007. Lecture Notes in Computer Science(), vol 5489. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03092-5_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03092-5_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03091-8

  • Online ISBN: 978-3-642-03092-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation