In this paper, a grammatical-inference algorithm is developed with finite sets of sample graphs as inputs and hyperedge-replacement grammars as outputs. In particular, the languages generated by inferred grammars contain the input samples. Essentially, the inference procedure iterates the application of an operation which decomposes hyperedge-replacement rules according to edge-disjoint coverings of the fight-hand sides of the rules. The main result is a characterization of the inferred grammars as “samplescomposing” meaning that each sample can be derived and each rule contributes to the generation of samples in a certain way.
CITATION STYLE
Jeltsch, E., & Kreowski, H. J. (1991). Grammatical inference based on hyperedge replacement. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 532 LNCS, pp. 461–474). Springer Verlag. https://doi.org/10.1007/BFb0017406
Mendeley helps you to discover research relevant for your work.