Tabulator-Turingmaschine und Komplexität. (Tabulator Turing machine and complexity)

DOI10.1007/BF02242353zbMath0223.02039OpenAlexW408870427MaRDI QIDQ2547888

Reinhold Weicker

Publication date: 1971

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02242353

Mathematics Subject Classification ID

Turing machines and related notions (03D10)

Cites Work

• On the Computational Complexity of Algorithms
• Recognition and parsing of context-free languages in time n3
• On-Line Turing Machine Computations
• A note on computing time for recognition of languages generated by linear grammars
• A Syntax-Analysis Procedure for Unambiguous Context-Free Grammars
• An efficient context-free parsing algorithm