Recognition time of context-free languages by on-line Turing machines
From MaRDI portal
Publication:5579495
DOI10.1016/S0019-9958(69)90463-XzbMath0186.01302MaRDI QIDQ5579495
Publication date: 1969
Published in: Information and Control (Search for Journal in Brave)
Related Items
Space complexity in on-line computation, On inverse deterministic pushdown transductions, The time-precision tradeoff problem on on-line probabilistic Turing machines, Theory of formal grammars, Berichtigung zu: Tabulator-Turingmaschinen und Komplexität