A note on computing time for recognition of languages generated by linear grammars

From MaRDI portal

Revision as of 03:31, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5546791

Jump to:navigation, search

DOI10.1016/S0019-9958(67)80008-1zbMath0163.01002MaRDI QIDQ5546791

Tadao Kasami

Publication date: 1967

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

zbMATH Keywords

languages, automata, networks

Related Items (6)

Unnamed Item ⋮ Further remarks on DNA overlap assembly ⋮ Relationships between pushdown automata with counters and complexity classes ⋮ Tabulator-Turingmaschine und Komplexität. (Tabulator Turing machine and complexity) ⋮ The time-precision tradeoff problem on on-line probabilistic Turing machines ⋮ Theory of formal grammars

This page was built for publication: A note on computing time for recognition of languages generated by linear grammars

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5546791&oldid=30151321"