BREADTH AND DEPTH GRAMMARS AND DEQUE AUTOMATA

DOI10.1142/S0129054190000163MaRDI QIDQ3358243zbMATH OpenOpenAlexFDO

Authors Claudio Citrini, Stefano Crespi Reghizzi, Dino Mandrioli, A. Cherubini

Publication date 1990

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054190000163

zbMATH Keywords

Deque automatapumping propertyBD grammarsbreadth-first grammarsDyck-AntiDyck language

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Recommendations

• scientific article; zbMATH DE number 4064525
• scientific article; zbMATH DE number 4147543
• Deque languages, automata and planar graphs
• Deque automata, languages, and planar graph representations
• QRT FIFO automata, breadth-first grammars and their relations
• Conjunctive grammars and alternating pushdown automata
• On the synchronized derivation depth of context-free grammars
• scientific article; zbMATH DE number 1962766
• scientific article; zbMATH DE number 6532546

Cited in

(6)

• Deque automata and a subfamily of context-sensitive languages which contains all semilinear bounded languages
• scientific article; zbMATH DE number 4147543 (Why is no real title available?)
• Deque languages, automata and planar graphs
• Deque automata, languages, and planar graph representations
• scientific article; zbMATH DE number 4064525 (Why is no real title available?)
• QRT FIFO automata, breadth-first grammars and their relations

This page was built for publication: BREADTH AND DEPTH GRAMMARS AND DEQUE AUTOMATA

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