scientific article; zbMATH DE number 965
From MaRDI portal
Publication:4711083
zbMath0706.68070MaRDI QIDQ4711083
Walter Vogler, Hans-Joerg Kreowski, Annegret Habel
Publication date: 25 June 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Grammars and rewriting systems (68Q42)
Related Items (11)
Finite tree automata with cost functions ⋮ The complexity of connectivity problems on context-free graph languages ⋮ Context-free graph languages of bounded degree are generated by apex graph grammars ⋮ Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs ⋮ Logical description of context-free graph languages ⋮ Decision problems for edge grammars ⋮ Edge-label controlled graph grammars ⋮ Least solutions of equations over N ⋮ A comparison of compatible, finite, and inductive graph properties ⋮ Decidability of the finiteness of ranges of tree transductions ⋮ Nondeterministic operations on finite relational structures
This page was built for publication:
