Eine untere Schranke für den Platzbedarf bei der Analyse beschränkter kontextfreier Sprachen
- 1 January 1977
- book chapter
- Published by Springer Nature
- p. 123-131
- https://doi.org/10.1007/3-540-08138-0_10
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Eine untere Schranke für den Platzbedarf bei der Analyse beschränkter kontextfreier SprachenPublished by Springer Nature ,1977
- Bracket-languages are recognizable in logarithmic spaceInformation Processing Letters, 1976
- A note on tape bounds for sla language processingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1975
- Space bounds for processing contentless inputsJournal of Computer and System Sciences, 1975
- About the deterministic simulation of nondeterministic (log n)-tape bounded turing machinesPublished by Springer Nature ,1975
- On tape-bounded complexity classes and multi-head finite automataPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1973
- Language recognition by marking automataInformation and Control, 1972
- A regularity test for pushdown machinesInformation and Control, 1967
- Linear AlgebraPublished by Springer Nature ,1967
- Memory bounds for recognition of context-free and context-sensitive languagesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1965