scientific article; zbMATH DE number 5790353

MaRDI QIDQ4929410zbMATH OpenFDO

Authors Klaus-Jörn Lange

Publication date 22 September 2010

Full work available at URL http://www.jucs.org/jucs_16_5/a_note_on_the

zbMATH Keywords

completenesscomplexity classesgrammarsstack automata

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Formal languages and automata (68Q45)

Cited in

(7)

• Queue Automata: Foundations and Developments
• Diving into the queue
• Tree-walking-storage automata
• Deterministic tree-walking-storage automata
• Deterministic real-time tree-walking-storage automata
• Deterministic real-time tree-walking-storage automata
• Leftmost derivations in CD grammar systems

This page was built for publication:

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