scientific article; zbMATH DE number 3410623
From MaRDI portal
Publication:5674993
Cited in
(25)- Power properties of NLC graph grammars with a polynomial membership problem
- Applicability of a production in a categorical grammar
- On the structure of node-label-controlled graph languages
- Sequential and cellular graph automata
- Graph grammars with neighbourhood-controlled embedding
- Dynamics of discrete systems and pattern reproduction
- Graph grammars and applications to specialization and evolution in biology
- A multidimensional approach to syntactic pattern recognition
- Formal languages of labelled graphs
- On labelled graph grammars
- Structure graphs and structure graph grammars
- A pumping lemma and the structure of derivations in the boundary NLC graph languages
- The generating power of boundary NLC graph grammars and cycle graphs
- Graph grammars according to the type of input and manipulated data: a survey
- Finite graph automata for linear and boundary graph languages
- Representing graph families with edge grammars
- Linear graph grammars: Power and complexity
- On structured graph grammars. II
- Using attributed flow graph parsing to recognize clichés in programs
- Graph automata for linear graph languages
- On structured graph grammars. I
- Note on node-rewriting graph grammars
- Fundamental methodological issues of syntactic pattern recognition
- Boundary graph grammars with dynamic edge relabeling
- Introduction to graph grammars with applications to semantic networks
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 Q5674993)
