Linear conjunctive grammars and one-turn synchronized alternating pushdown automata

DOI10.1007/978-3-642-20169-1_1MaRDI QIDQ2999249zbMATH OpenOpenAlexFDO

Authors Tamar Aizikowitz, Michael Kaminski

Publication date 11 May 2011

Published in Formal Grammar (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-20169-1_1

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Linear conjunctive grammars and one-turn synchronized alternating pushdown automata
• LR(0) conjunctive grammars and deterministic synchronized alternating pushdown automata
• \(LR(0)\) conjunctive grammars and deterministic synchronized alternating pushdown automata
• Comparing linear conjunctive languages to subfamilies of the context-free languages
• On the equivalence of linear conjunctive grammars and trellis automata

Cited in

(9)

• On the equivalence of linear conjunctive grammars and trellis automata
• A grammatical characterization of alternating pushdown automata
• Conjunctive grammars and alternating pushdown automata
• Comparing linear conjunctive languages to subfamilies of the context-free languages
• \(LR(0)\) conjunctive grammars and deterministic synchronized alternating pushdown automata
• LR(0) conjunctive grammars and deterministic synchronized alternating pushdown automata
• Linear conjunctive grammars and one-turn synchronized alternating pushdown automata
• Conjunctive and Boolean grammars: the true general case of the context-free grammars
• Eliminating stack symbols in push-down automata and linear indexed grammars

This page was built for publication: Linear conjunctive grammars and one-turn synchronized alternating pushdown automata

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