1986 | OriginalPaper | Chapter
Rule Trees Represent Derivations in Edge Replacement Systems
Author : Hans-Jörg Kreowski
Published in: The Book of L
Publisher: Springer Berlin Heidelberg
Included in: Professional Book Archive
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Whoever is looking for context-free graph grammars should consider edge replacement systems as a possibility. This advice is supported by the investigation of rule trees and their relationship to the derivations in an edge replacement system. It turns out that rule trees are quite similar to derivation trees which are an essential element in the theory of context-free Chomsky grammars.