Somewhat finite approaches to infinite sentences
Autor: | R. Suzanne Zeitman |
---|---|
Rok vydání: | 1993 |
Předmět: | |
Zdroj: | Annals of Mathematics and Artificial Intelligence. 8:27-36 |
ISSN: | 1573-7470 1012-2443 |
DOI: | 10.1007/bf02451547 |
Popis: | 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. |
Databáze: | OpenAIRE |
Externí odkaz: |