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

DOI10.1016/S0019-9958(69)90463-XMaRDI QIDQ5579495zbMATH OpenFDO

Authors H. Gallaire

Publication date 1969

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

zbMATH Keywords

languages, automata, networks

Cited in

(6)

• On inverse deterministic pushdown transductions
• The time-precision tradeoff problem on on-line probabilistic Turing machines
• Theory of formal grammars
• If the current clique algorithms are optimal, so is Valiant's parser
• Space complexity in on-line computation
• Berichtigung zu: Tabulator-Turingmaschinen und Komplexität

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5579495)