Time-bounded grammars and their languages
- 1 August 1971
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 5 (4) , 397-429
- https://doi.org/10.1016/s0022-0000(71)80025-9
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Time- and tape-bounded turing acceptors and AFLsJournal of Computer and System Sciences, 1970
- Quasi-realtime languagesTheory of Computing Systems, 1970
- A note on undecidable properties of formal languagesTheory of Computing Systems, 1968
- Some remarks on derivations in general rewriting systemsInformation and Control, 1968
- Mappings which preserve context sensitive languagesInformation and Control, 1966
- One-tape, off-line Turing machine computationsInformation and Control, 1965
- On the computational complexity of algorithmsTransactions of the American Mathematical Society, 1965
- A New Normal-Form Theorem for Context-Free Phrase Structure GrammarsJournal of the ACM, 1965
- Classes of languages and linear-bounded automataInformation and Control, 1964
- Three theorems on phrase structure grammars of type 1Information and Control, 1963