Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. D. Angluin. Inductive inference of formal languages from positive data. Information and Control ,45:117–135, 1980.
2. S. Arikawa, S.Goto, S.Ohsuga and T.Yokomori(Eds.). Algorithmic Learning Theory (Proceedings of ALT’90). Ohmsha and Springer-Verlag, 1990.
3. K. Culik II and J.Karhumäki. A new proof for the DOL sequence equivalence problem and its implications. In G.Rozenberg and A.Salomaa, editors, The Book of L ,pages 63–74. Springer-Verlag, 1986.
4. P. Doucet. The syntactic inference problem for DOL-sequences. In L-Systems ,Lecture Notes in Computer Science 15, Springer-Verlag, pages 146–161, 1974.
5. H. Feliciangeli and G.T.Herman. Algorithms for producing grammars from sample derivations: A common problem of formal language theory and developmental biology. Journal of Computer and System Sciences ,7:97–118, 1973.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Elliptic curves and Fibonacci numbers arising from Lindenmayer system with symbolic computation;Applicable Algebra in Engineering, Communication and Computing;2011-03
2. Grammatical Inference and Learning;Formal Languages and Applications;2004
3. L Systems;Handbook of Formal Languages;1997