DocumentCode
2176861
Title
A grammatical characterization of exponential-time languages
Author
Rounds, William C.
fYear
1975
fDate
13-15 Oct. 1975
Firstpage
135
Lastpage
143
Abstract
We show that the languages generated by a constrained form of Chomsky´s transformational grammars characterize the languages recognized by Turing machines in deterministic exponential (2cn) time. The constraints on the transformational grammars are satisfied by many, though not all, known grammars in linguistic practice. We also give a simple algebraic characterization of the same class of languages and use it for the linguistic characterization.
Keywords
Automata; Character generation; Character recognition; Context modeling; Mathematical model; Natural languages; System testing; Turing machines; Writing;
fLanguage
English
Publisher
ieee
Conference_Titel
Foundations of Computer Science, 1975., 16th Annual Symposium on
Conference_Location
USA
ISSN
0272-5428
Type
conf
DOI
10.1109/SFCS.1975.1
Filename
4567870
Link To Document