Publication:4028125
From MaRDI portal
zbMath0768.68124MaRDI QIDQ4028125
Publication date: 28 March 1993
context-free grammar; transitions; pushdown automaton; canonical graphs; deterministic graph grammars; pushdown transition graph; alphabetic graphs; context-free graph
68Q45: Formal languages and automata
68R10: Graph theory (including graph drawing) in computer science
68Q42: Grammars and rewriting systems
Related Items
Pushdown automata, multiset automata, and Petri nets, On the regular structure of prefix rewriting, Decidability of bisimulation equivalence for normed pushdown processes, Complete SAT-Based Model Checking for Context-Free Processes