The Tape Comilexity of Some Classes of Szilard Languages
- 1 September 1977
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 6 (3) , 460-466
- https://doi.org/10.1137/0206032
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A decidability theorem for a class of vector-addition systemsInformation Processing Letters, 1975
- An analysis of grammars by their derivation setsInformation and Control, 1974
- On derivation languages corresponding to context-free grammarsActa Informatica, 1974
- Associate languages and derivational complexity of formal grammars and languagesInformation and Control, 1973
- Tape bounds for time-bounded turing machinesJournal of Computer and System Sciences, 1972
- Parallel program schemataJournal of Computer and System Sciences, 1969
- Programmed Grammars and Classes of Formal LanguagesJournal of the ACM, 1969
- Control sets on grammarsTheory of Computing Systems, 1968