Grammatical Inference Based on Hyperedge Replacement
作者： Eric Jeltsch , Hans-Jörg Kreowski
DOI: 10.1007/BFB0017406
关键词:
摘要: In this paper, a grammatical-inference algorithm is developed with finite sets of sample graphs as inputs and hyperedge-replacement grammars outputs. particular, the languages generated by inferred contain input samples. Essentially, inference procedure iterates application an operation which decomposes rules according to edge-disjoint coverings right-hand sides rules. The main result characterization “samples-composing” meaning that each can be derived rule contributes generation samples in certain way.
springer.com
sci-hub.se 参考文章(17)
Hans-Rainer Beick, Klaus P. Jantke, Combining Postulates of Naturalness in Inductive Inference. Journal of Automata, Languages and Combinatorics. ,vol. 17, pp. 465- 484 ,(1981)
Annegret Habel, Hans-Jörg Kreowski, Filtering hyperedge-replacement languages through compatible properties workshop on graph theoretic concepts in computer science. ,vol. 411, pp. 107- 120 ,(1990) , 10.1007/3-540-52292-1_8
B. Bartsch-Spörl, Grammatical inference of graph grammars for syntactic pattern recognition international workshop on graph grammars and their application to computer science. pp. 1- 7 ,(1982) , 10.1007/BFB0000095
Bruno Courcelle, On context-free sets of graphs and their monadic second-order theory international workshop on graph grammars and their application to computer science. pp. 133- 146 ,(1986) , 10.1007/3-540-18771-5_50
Annegret Habel, Hans-Jörg Kreowski, Some structural aspects of hypergraph languages generated by hyperedge replacement symposium on theoretical aspects of computer science. pp. 207- 219 ,(1987) , 10.1007/BFB0039608
Annegret Habel, Hans-Jörg Kreowski, May we introduce to you: hyperedge replacement international workshop on graph grammars and their application to computer science. pp. 15- 26 ,(1986) , 10.1007/3-540-18771-5_41
Thomas Lengauer, Egon Wanke, Efficient analysis of graph properties on context-free graph languages international colloquium on automata, languages and programming. pp. 379- 393 ,(1988) , 10.1007/3-540-19488-6_129
E Mark Gold, Language identification in the limit Information & Computation. ,vol. 10, pp. 447- 474 ,(1967) , 10.1016/S0019-9958(67)91165-5
Michel Bauderon, Bruno Courcelle, Graph expressions and graph rewritings Theory of Computing Systems \/ Mathematical Systems Theory. ,vol. 20, pp. 83- 127 ,(1987) , 10.1007/BF01692060
H JURGENSEN, A LINDENMAYER, Inference algorithms for developmental systems with cell lineages Bulletin of Mathematical Biology. ,vol. 49, pp. 93- 123 ,(1987) , 10.1016/S0092-8240(87)80036-8