About graph and hypergraph context free grammars

Authors:
Silviu Dumitrescu
Affiliations:
Department of Informatics, University Transilvania of Brasov, Romania
Venue:
Proceedings of the 15th WSEAS international conference on Computers
Year:
2011

Citing 8
Cited 0

Formal languages

Formal languages
Characteristics of graph languages Generated by edge replacement

Theoretical Computer Science
Handbook of graph grammars and computing by graph transformation: volume I. foundations

Handbook of graph grammars and computing by graph transformation: volume I. foundations
Tree-based picture generation

Theoretical Computer Science
Chain-Code Pictures and Collages Generated by Hyperedge Replacement

Selected papers from the 5th International Workshop on Graph Gramars and Their Application to Computer Science
Several aspects of context freeness for hyperedge replacement grammars

WSEAS Transactions on Computers
About normal forms for hyperedge replacement grammars

ICCOMP'08 Proceedings of the 12th WSEAS international conference on Computers
Hyperedge replacement languages and pushdown automata

MACMESE'08 Proceedings of the 10th WSEAS international conference on Mathematical and computational methods in science and engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

The main idea of this paper is to show some important differences between graph grammars and hypergraph grammars in context of freeness. On the other hand, we give a possibility to transform the planar structure of a hypergraph into a linear one with concern of determinism. This can create a path to transform a pushdown automaton into a generative grammar equivalent.