Skip to main content
SpringerLink
Log in

Somewhat finite approaches to infinite sentences

  • Published:
Annals of Mathematics and Artificial Intelligence Aims and scope Submit manuscript

Abstract

In refs. [13] and [14], Langendoen and Postal argue for the consideration of infinite sentences in the study of linguistics. The falsity of the “finiteness limitation on sentence size” is said to put the study of natural languages entirely outside the realm of theoretical computer science. It is this claim, together with the assertion that the existence of sentences of infinite length precludes any characterization of a language by some kind of classical machine, which this paper seeks to address. An overview of the theory of automata on infinite objects is given, showing that the infinitude of a sentence or computation does not prevent its description by traditional automata with modified acceptance conditions.

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

Access this article

Log in via an institution

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,Int. Congress of Logic Methodology and Philosophy of Science, Stanford, CA (1960) pp. 1–11.

  2. J.R. Büchi, The monadic theory of ω1, in:Decidable Theories II, Lecture Notes in Mathematics 328 (Springer, Berlin, 1973) pp. 1–127.

    Google Scholar 

  3. R.S. Cohen and A.Y. Gold, Theory of ω-languages. I: Characterization of ω-context-free languages, J. Comp. Syst. Sci. 15(1977)169–184.

    MATH  MathSciNet  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

  5. R.S. Cohen and A.Y. Gold, ω-Computations on deterministic pushdown machines, J. Comp. Syst. Sci. 16(1978)275–300.

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  7. R.S. Cohen and A.Y. Gold, On the complexity of ω-type Turing acceptors, Theor. Comp. Sci. 10(1980)249–272.

    Article  MATH  MathSciNet  Google Scholar 

  8. J. Engelfriet and H.J. Hoogeboom, Automata with storage on infinite words,Proc. 16th ICALP, Lecture Notes in Computer Science 372 (Springer, Berlin, 1989) pp. 289–303.

    Google Scholar 

  9. S. Ginsburg, S.A. Griebach and M.A. Harrison, One-way stack automata, J. ACM 14(1967) 389–418.

    Article  MATH  Google Scholar 

  10. Y. Gurevich and L. Harrington, Trees, automata, and games,Proc. 14th ACM Symp. on Theory of Computing, San Francisco (1982) pp. 60–65.

  11. D. Harel and D. Raz, Deciding properties of nonregular programs,Proc. 31st IEEE Symp. on Foundations of Computer Science, St Louis (1990) pp. 652–661.

  12. L.H. Landweber, Decision problems for ω-automata, Math. Syst. Theory 3(1969)376–384.

    Article  MATH  MathSciNet  Google Scholar 

  13. D.T. Langendoen and P.M. Postal,The Vastness of Natural Languages (Basil Blackwell, Oxford, 1984).

    Google Scholar 

  14. D.T. Langendoen and P.M. Postal, Sets and sentences, in:The Philosophy of Linguistics, ed. J.J. Katz (Oxford University Press, New York, 1985) pp. 227–248.

    Google Scholar 

  15. G. Matthews, A note on asymmetry in phrase structure grammars, Inform. Contr. 7(1964)360–365.

    Article  MATH  Google Scholar 

  16. R. McNaughton, Testing and generating infinite sequences by a finite automaton, Inform. Contr. 9(1966)521–530.

    MATH  MathSciNet  Google Scholar 

  17. D.E. Muller, Infinite sequences and finite machines,Proc. 4th IEEE. Symp. on Switching Theory and Logical Design, New York (1963) pp. 3–16.

  18. L. Priese, R. Rehrmann and U. Willecke-Klemme, An introduction to the regular theory of fairness, Theor. Comp. Sci. 54(1987)139–163.

    Article  MATH  MathSciNet  Google Scholar 

  19. A. Nerode, A. Yakhnis and V. Yakhnis, Concurrent programs as strategies in infinite games, TR 90-78, Mathematical Sciences Institute, Cornell University (1990).

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

    Article  MATH  MathSciNet  Google Scholar 

  21. L. Staiger, Empty-storage-acceptance of ω-languages,Proc. FCT'77, Lecture Notes in Computer Science 56 (Springer, Berlin, 1977) pp. 516–521.

    Google Scholar 

  22. W. Thomas, A combinatorial approach to the theory of ω-automata, Inform. Contr. 48(1981) 261–283.

    Article  MATH  Google Scholar 

  23. A. Turing, On computable numbers, with an application to the Entscheidungsproblem, Proc. Math. Soc. (London) 42(1936)230–265.

    MATH  Google Scholar 

  24. R. Valk, Infinite behaviour of Petri nets, Theor. Comp. Sci. 25(1982)311–341.

    Article  MathSciNet  Google Scholar 

  25. M. Vardi and P. Wolper, Automata-theoretic techniques for modal logics of programs, J. Comp. Syst. Sci. 32(1986)183–221.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Wayne State University, 48202, Detroit, MI, USA

    Suzanne Zeitman

Authors
  1. Suzanne Zeitman
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zeitman, S. Somewhat finite approaches to infinite sentences. Ann Math Artif Intell 8, 27–36 (1993). https://doi.org/10.1007/BF02451547

Download citation

  • Issue Date:

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

Keywords

Search

Navigation