Deque automata and a subfamily of context-sensitive languages which contains all semilinear bounded languages

DOI10.1016/0304-3975(85)90164-1zbMath0603.68081OpenAlexW2020370487MaRDI QIDQ1082824

Kathleen Ayers

Publication date: 1985

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

Full work available at URL: https://doi.org/10.1016/0304-3975(85)90164-1

zbMATH Keywords

pushdown automatonordered grammar

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

A note on: `Deque automata and a subfamily of context-sensitive languages which contains all semilinear bounded languages' (by K. Ayers), Deque automata, languages, and planar graph representations, On the conditioning of polynomial and rational forms, ON THE LEFTMOST DERVIATION IN MATRIX GRAMMARS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Grammars with partial ordering of the rules
• Some restrictive devices for context-free grammars