A note on: `Deque automata and a subfamily of context-sensitive languages which contains all semilinear bounded languages' (by K. Ayers)

DOI10.1016/0304-3975(87)90115-0zbMath0635.68089OpenAlexW2007185797WikidataQ127436689 ScholiaQ127436689MaRDI QIDQ1097706

Franz-Josef Brandenburg

Publication date: 1987

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(87)90115-0

zbMATH Keywords

context-sensitive languagespushdown automatonnondeterministic automataordered grammarDeque automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Deque automata, languages, and planar graph representations ⋮ ON THE LEFTMOST DERVIATION IN MATRIX GRAMMARS

Cites Work

• Unnamed Item
• Unnamed Item
• Deque automata and a subfamily of context-sensitive languages which contains all semilinear bounded languages
• Multiple equality sets and Post machines
• Uniform simulations of nondeterministic real time multitape turing machines
• Quasi-realtime languages

This page was built for publication: A note on: `Deque automata and a subfamily of context-sensitive languages which contains all semilinear bounded languages' (by K. Ayers)