scientific article

From MaRDI portal

Publication:4028125

Jump to:navigation, search

zbMath0768.68124MaRDI QIDQ4028125

Roland Monfort, Didier Caucal

Publication date: 28 March 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

context-free grammar transitions pushdown automaton canonical graphs deterministic graph grammars pushdown transition graph alphabetic graphs context-free graph

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Grammars and rewriting systems (68Q42)

Related Items (7)

The Boolean Determinant Calculus ⋮ Bisimulation collapse and the process taxonomy ⋮ Complete SAT-Based Model Checking for Context-Free Processes ⋮ Decidability of bisimulation equivalence for normed pushdown processes ⋮ On the regular structure of prefix rewriting ⋮ Pushdown automata, multiset automata, and Petri nets ⋮ Decidability of bisimulation equivalence for normed pushdown processes

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4028125&oldid=17741136"