BREADTH AND DEPTH GRAMMARS AND DEQUE AUTOMATA

DOI10.1142/S0129054190000163zbMATH Open0732.68066OpenAlexW2065943164MaRDI QIDQ3358243FDOQ3358243

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

Recommendations

• scientific article; zbMATH DE number 4064525
• scientific article
• 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 Keywords

Deque automatapumping propertyBD grammarsbreadth-first grammarsDyck-AntiDyck language

Mathematics Subject Classification ID

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

Cited In (6)

• Deque languages, automata and planar graphs
• Title not available (Why is that?)
• QRT FIFO automata, breadth-first grammars and their relations
• Deque automata, languages, and planar graph representations
• Title not available (Why is that?)
• Deque automata and a subfamily of context-sensitive languages which contains all semilinear bounded languages

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)