Author of the publication

Context-Free Graph Languages of Bounded Degree are Generated by Apex Graph Grammars.

, , and . Acta Inf., 31 (4): 341-378 (1994)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Context-Free Hypergraph Grammars Have the Same Term-Generating Power as Attribute Grammars, and . Acta Informatica, (1992)The Term Generating Power of Context-Free Hypergraph Grammars., and . Graph-Grammars and Their Application to Computer Science, volume 532 of Lecture Notes in Computer Science, page 328-243. Springer, (1990)Context-Free Graph Languages of Bounded Degree are Generated by Apex Graph Grammars., , and . Acta Inf., 31 (4): 341-378 (1994)The Term-generating Power of Context-free Hypergraph Grammar and Attribute Grammars, and . report, 89--17. Vakgroep Informatica, Rijksuniversiteit te Leiden, (November 1989)