scientific article; zbMATH DE number 809155
From MaRDI portal
Publication:4852905
Recommendations
- A characterization of the sets of hypertrees generated by hyperedge-replacement graph grammars
- On hyperedge replacement and BNLC graph grammars
- scientific article; zbMATH DE number 219258
- scientific article; zbMATH DE number 5018643
- scientific article; zbMATH DE number 4035178
- The complexity of graph languages generated by hyperedge replacement
- An Algorithm for Hypergraph Completion According to Hyperedge Replacement Grammars
- scientific article; zbMATH DE number 5842462
- Hyperedge replacement: grammars and languages
- scientific article; zbMATH DE number 522845
Cites work
- A comparison of boundary graph grammars and context-free hypergraph grammars
- An axiomatic definition of context-free rewriting and its application to NLC graph grammars
- Boundary NLC graph grammars—Basic definitions, normal forms, and complexity
- Characteristics of graph languages generated by edge replacement
- Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Graph expressions and graph rewritings
- Graph minors. V. Excluding a planar graph
- Graph minors. XIII: The disjoint paths problem
- Handle-rewriting hypergraph grammars
- scientific article; zbMATH DE number 3846895 (Why is no real title available?)
- scientific article; zbMATH DE number 4035178 (Why is no real title available?)
- scientific article; zbMATH DE number 4053039 (Why is no real title available?)
- scientific article; zbMATH DE number 3660804 (Why is no real title available?)
- scientific article; zbMATH DE number 17539 (Why is no real title available?)
- scientific article; zbMATH DE number 177419 (Why is no real title available?)
- scientific article; zbMATH DE number 177441 (Why is no real title available?)
- scientific article; zbMATH DE number 1142315 (Why is no real title available?)
- Hyperedge replacement: grammars and languages
- Hypergraph languages of bounded degree
- Metatheorems for decision problems on hyperedge replacement graph languages
- Monadic second-order definable graph transductions: a survey
- Monadic second-order evaluations on tree-decomposable graphs
- Structural properties of context-free sets of graphs generated by vertex replacement
- The monadic second order logic of graphs. VI: On several representations of graphs by relational structures
- The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability
- The monadic second-order logic of graphs. VII: Graphs as relational structures
- The string generating power of context-free hypergraph grammars
- Tree acceptors and some of their applications
- Weak Second‐Order Arithmetic and Finite Automata
Cited in
(50)- Metatheorems for decision problems on hyperedge replacement graph languages
- The monadic second-order logic of graphs. VII: Graphs as relational structures
- NP-completeness of \(k\)-connected hyperedge-replacement languages of order \(k\)
- Nondeterministic operations on finite relational structures
- A characterization of the sets of hypertrees generated by hyperedge-replacement graph grammars
- Hypergraph languages of bounded degree
- Monadic second-order definable graph transductions: a survey
- The monadic second order logic of graphs. VI: On several representations of graphs by relational structures
- Context-free graph languages of bounded degree are generated by apex graph grammars
- Logical description of context-free graph languages
- A monadic second-order definition of the structure of convex hypergraphs.
- Tree-width and the monadic quantifier hierarchy.
- A comparison of tree transductions defined by monadic second order logic and by attribute grammars
- Tree-based picture generation
- The monadic second-order logic of graphs. VIII: Orientations
- Macro tree transducers, attribute grammars, and MSO definable tree translations.
- The monadic second-order logic of graphs. XIV: Uniformly sparse graphs and edge set quantifica\-tions.
- Structural properties of context-free sets of graphs generated by vertex replacement
- Upper bounds to the clique width of graphs
- Counting truth assignments of formulas of bounded tree-width or clique-width
- The monadic second-order logic of graphs. XV: On a conjecture by D. Seese
- Theoretical properties in hypergraphs
- scientific article; zbMATH DE number 4160146 (Why is no real title available?)
- From Separation Logic to Hyperedge Replacement and Back
- scientific article; zbMATH DE number 4035178 (Why is no real title available?)
- scientific article; zbMATH DE number 4062634 (Why is no real title available?)
- scientific article; zbMATH DE number 177437 (Why is no real title available?)
- scientific article; zbMATH DE number 522845 (Why is no real title available?)
- The obstructions of a minor-closed set of graphs defined by hyperedge replacement can be constructed
- scientific article; zbMATH DE number 219258 (Why is no real title available?)
- scientific article; zbMATH DE number 219278 (Why is no real title available?)
- scientific article; zbMATH DE number 1361481 (Why is no real title available?)
- scientific article; zbMATH DE number 965 (Why is no real title available?)
- Generalized rational relations and their logical definability
- scientific article; zbMATH DE number 7559449 (Why is no real title available?)
- A Greibach normal form for context-free graph grammars
- scientific article; zbMATH DE number 6747949 (Why is no real title available?)
- On spectra of sentences of monadic second order logic with counting
- Canonisation and Definability for Graphs of Bounded Rank Width
- On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
- Algorithmic uses of the Feferman-Vaught theorem
- Spatial existential positive logics for hyperedge replacement grammars
- Characterizations of monadic second order definable context-free sets of graphs
- Hyperedge replacement: grammars and languages
- Recognising k-connected hypergraphs in cubic time
- Rank-decreasing transductions
- An axiomatization of graphs
- Trees, grids, and MSO decidability: from graphs to matroids
- Vertex-minors, monadic second-order logic, and a conjecture by Seese
- Second-order abstract categorial grammars as hyperedge replacement grammars
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 Q4852905)
