scientific article; zbMATH DE number 4049099
From MaRDI portal
Publication:3785988
Recommendations
Cited in
(39)- Metatheorems for decision problems on hyperedge replacement graph languages
- Power properties of NLC graph grammars with a polynomial membership problem
- Algorithms for graph problems on BNLC structured garphs
- The string generating power of context-free hypergraph grammars
- 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
- Context-free hypergraph grammars have the same term-generating power as attribute grammars
- Lyndon trees
- The equivalence of bottom-up and top-down tree-to-graph transducers
- A partial k-arboretum of graphs with bounded treewidth
- 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
- The translation power of top-down tree-to-graph transducers
- Context-free graph languages of bounded degree are generated by apex graph grammars
- Synthesized and inherited functions. A new computational model for syntax-directed semantics
- Logical description of context-free graph languages
- Generating irregular partitionable data structures
- Applications of a hyper-graph grammar system in adaptive finite-element computations
- Infinite hypergraphs. I: Basic properties
- Bottom-up unranked tree-to-graph transducers for translation into semantic graphs
- Handle-rewriting hypergraph grammars
- Graph transformation for incremental natural language analysis
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Uniform parsing for hyperedge replacement grammars
- Selected Decision Problems for Square-Refinement Collage Grammars
- The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
- On relating rewriting systems and graph grammars to event structures
- A Greibach normal form for context-free graph grammars
- Graph-theoretic properties compatible with graph derivations
- On the power of local graph expansion grammars with and without additional restrictions
- Algebraic approach to single-pushout graph transformation
- Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming
- Recursively indefinite databases
- Winning strategies for the synchronization game on subclasses of finite automata
- A new notion of regularity: finite state automata accepting graphs
- Modular tree transducers
- The generative power of delegation networks
- Undecidability of the bandwidth problem on linear graph languages
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 Q3785988)
