Recognition time of context-free languages by on-line Turing machines

DOI10.1016/S0019-9958(69)90463-XzbMath0186.01302MaRDI QIDQ5579495

H. Gallaire

Publication date: 1969

Published in: Information and Control (Search for Journal in Brave)

zbMATH Keywords

languages, automata, networks

Related Items (6)

If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser ⋮ Space complexity in on-line computation ⋮ On inverse deterministic pushdown transductions ⋮ Berichtigung zu: Tabulator-Turingmaschinen und Komplexität ⋮ The time-precision tradeoff problem on on-line probabilistic Turing machines ⋮ Theory of formal grammars

This page was built for publication: Recognition time of context-free languages by on-line Turing machines