On inverse deterministic pushdown transductions
- 1 June 1978
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 16 (3) , 423-444
- https://doi.org/10.1016/0022-0000(78)90028-4
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Space-bounded reducibility among combinatorial problemsJournal of Computer and System Sciences, 1975
- A universal context-free grammarInformation and Control, 1975
- Jump PDA’s and Hierarchies of Deterministic Context-Free LanguagesSIAM Journal on Computing, 1974
- The Hardest Context-Free LanguageSIAM Journal on Computing, 1973
- How to Make Arbitrary Grammars Look Like Context-Free GrammarsSIAM Journal on Computing, 1973
- Characterizations of Pushdown Machines in Terms of Time-Bounded ComputersJournal of the ACM, 1971
- Relationships between nondeterministic and deterministic tape complexitiesJournal of Computer and System Sciences, 1970
- Recognition time of context-free languages by on-line Turing machinesInformation and Control, 1969
- Two-way pushdown automataInformation and Control, 1967
- Deterministic context free languagesInformation and Control, 1966