scientific article; zbMATH DE number 965
From MaRDI portal
Publication:4711083
zbMATH Open0706.68070MaRDI QIDQ4711083FDOQ4711083
Authors: Annegret Habel, Hans-Jörg Kreowski, Walter Vogler 
Publication date: 25 June 1992
Title of this publication is not available (Why is that?)
Recommendations
Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Grammars and rewriting systems (68Q42)
Cited In (17)
- Title not available (Why is that?)
- Decision problems for edge grammars
- Edge-label controlled graph grammars
- Hyperedge replacement: grammars and languages
- Least solutions of equations over N
- Nondeterministic operations on finite relational structures
- Metatheorems for decision problems on hyperedge replacement graph languages
- The bounded degree problem for NLC grammars is decidable
- Finite tree automata with cost functions
- Decidability of the finiteness of ranges of tree transductions
- Context-free graph languages of bounded degree are generated by apex graph grammars
- Logical description of context-free graph languages
- Graph-theoretic properties compatible with graph derivations
- The complexity of connectivity problems on context-free graph languages
- A comparison of compatible, finite, and inductive graph properties
- Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs
- Title not available (Why is that?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4711083)
