On the active and full use of memory in right-boundary grammars and push- down automata

DOI10.1016/0304-3975(86)90095-2zbMath0638.68075OpenAlexW1999910908MaRDI QIDQ1099637

Hendrik Jan Hoogeboom, Grzegorz Rozenberg, Andrzej Ehrenfeucht

Publication date: 1986

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

Full work available at URL: https://doi.org/10.1016/0304-3975(86)90095-2

zbMATH Keywords

push-down automatacoordinated pair systempair of rewritingsright-boundary grammar

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Recording the use of memory in right-boundary grammars and push-down automata ⋮ On the active and full use of memory in right-boundary grammars and push- down automata

Cites Work

• On coordinated selective substitutions: Towards a unified theory of grammars and machines
• On the active and full use of memory in right-boundary grammars and push- down automata
• Every two equivalent DOL systems have a regular true envelope
• Coordinated pair systems ; part I : Dyck works and classical pumping
• Regular canonical systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the active and full use of memory in right-boundary grammars and push- down automata