Skip to main content
Springer Nature Link
Log in

Description of restricted automata by first-order formulae

  • Published:
Mathematical systems theory Aims and scope Submit manuscript

Abstract

The emptiness problem for stack automata is shown decidable by reducing that problem to a solvable decision problem for the predicate calculus. Similar decision procedures are outlined for classes of weaker automata.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J. R. Büchi, On a decision method in restricted second-order arithmetic,Proceedings of the International Congress on Logic, Methodology, and the Philosophy of Science, 1960, Stanford University Press, 1962, pp. 1–11.

  2. J. Doner, Tree acceptors and some of their applications,J. Comput. System Sci. 4 (1970), 406–451.

    Google Scholar 

  3. B. Dreben andW. D. Goldfarb, A Systematic Treatment of the Decision Problem, forthcoming.

  4. B. Dreben, A. S. Kahr andH. Wang, Classification of AEA formulas by letter atoms,Bull. Amer. Math. Soc. 68 (1962), 528–532.

    Google Scholar 

  5. S. Ginsburg, S. Greibach andM. Harrison, One-way stack automata,J. Assoc. Comput. Mach. 14 (1967), 389–418.

    Google Scholar 

  6. S. Ginsburg, S. Greibach andM. Harrison, Stack automata and compiling,J. Assoc. Comput. Mach. 14 (1967), 172–201.

    Google Scholar 

  7. J. Hopcroft andJ. Ullman,Formal Languages and their Relation to Automata, Addison-Wesley, Reading, Mass., 1969.

    Google Scholar 

  8. H. Lewis, Program schemata and the first-order decision problem,J. Comput. System Sci. 8 (1974), 71–83.

    Google Scholar 

  9. Z. Manna, Properties of programs and the first-order predicate calculus,J. Assoc. Comput. Mach. 16 (1969) 244–255.

    Google Scholar 

  10. M. O. Rabin, Decidability of second-order theories and automata on infinite trees,Trans. Amer. Math. Soc. 141 (1969), 1–35.

    Google Scholar 

  11. A. M. Turing, On computable numbers with an application to the Entscheidungsproblem,Proc. London Math. Soc. (2) 42 (1936–7), 230–265; Correction:43 (1937), 544–546.

    Google Scholar 

  12. H. Wang, Dominoes and the AEA case of the decision problem,Symposium on Mathematical Theory of Automata, Polytechnic Institute of Brooklyn, 1962, pp. 23–55.

Download references

Author information

Authors and Affiliations

  1. Aiken Computation Laboratory, Harvard University, 02138, Cambridge, Massachusetts, USA

    Harry R. Lewis

Authors
  1. Harry R. Lewis
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This research has been supported in part by NSF Grant GJ-30409, by the Center for Research in Computing Technology, Division of Engineering and Applied Physics, Harvard University, and by fellowships from the National Science Foundation and the International Business Machines Corporation.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lewis, H.R. Description of restricted automata by first-order formulae. Math. Systems Theory 9, 97–104 (1975). https://doi.org/10.1007/BF01698129

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation