About normal forms for hyperedge replacement grammars

Authors:
Silviu Dumitrescu
Affiliations:
Department of Informatics, University Transilvania of Brasov, Romania
Venue:
ICCOMP'08 Proceedings of the 12th WSEAS international conference on Computers
Year:
2008

Citing 4
Cited 5

Formal languages

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
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
Aspects of dictionary making developing an in-house text parsing tool

WSEAS Transactions 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
About digital images and Lindenmayer systems

MAMECTIS'10 Proceedings of the 12th WSEAS international conference on Mathematical methods, computational techniques and intelligent systems
About graph and hypergraph context free grammars

Proceedings of the 15th WSEAS international conference on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we are studying normal forms concerning to hyperedge replacement grammars. In context freeness of these grammars we can transform each of it into an equivalent grammar without λ productions and without rewritings. After that, in a nondeterministic way, we'll create equivalent grammars in Chomsky Normal Form or Greibach Normal Form. Both normal forms are inspired by string grammars.