Formal languages
Handbook of graph grammars and computing by graph transformation: volume I. foundations
Handbook of graph grammars and computing by graph transformation: volume I. foundations
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
An application of L-system and IFS in 3D fractal simulation
WSEAS TRANSACTIONS on SYSTEMS
Aspects regarding the quality of education processes based on WEB 2.0 technologies
AIC'08 Proceedings of the 8th conference on Applied informatics and communications
About normal forms for hyperedge replacement grammars
ICCOMP'08 Proceedings of the 12th WSEAS international conference on Computers
About digital images and Lindenmayer systems
MAMECTIS'10 Proceedings of the 12th WSEAS international conference on Mathematical methods, computational techniques and intelligent systems
A local greibach normal form for hyperedge replacement grammars
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
About graph and hypergraph context free grammars
Proceedings of the 15th WSEAS international conference on Computers
| Hi-index | 0.00 |
In this paper we survey several aspects related to normal forms of hyperedge replacement grammars. Considering context free hyperedge replacement grammars we introduce, inspired by string grammars, Chomsky Normal Form and Greibach Normal Form. The algorithm of conversion is quite the same with the algorithm for string grammars. The important difference is related to the fact that hyperedge grammars are two-dimensional and that's why parsing productions, in order to transform into string grammars, can be done only nondeterministic. A detailed example of conversion to both normal forms is introduced to clarify all the algorithm steps.