Mitsuo Wakatsuki, Etsuji Tomita, Go Yamada. A Unified Algorithm for Extending Classes of Languages Identifiable in the Limit from Positive Data. In Yasubumi Sakakibara, Satoshi Kobayashi, Kengo Sato, Tetsuro Nishino, Etsuji Tomita, editors, Grammatical Inference: Algorithms and Applications, 8th International Colloquium, ICGI 2006, Tokyo, Japan, September 20-22, 2006, Proceedings. Volume 4201 of Lecture Notes in Computer Science, pages 161-174, Springer, 2006. [doi]
@inproceedings{WakatsukiTY06,
title = {A Unified Algorithm for Extending Classes of Languages Identifiable in the Limit from Positive Data},
author = {Mitsuo Wakatsuki and Etsuji Tomita and Go Yamada},
year = {2006},
doi = {10.1007/11872436_14},
url = {http://dx.doi.org/10.1007/11872436_14},
tags = {data-flow language, data-flow},
researchr = {https://researchr.org/publication/WakatsukiTY06},
cites = {0},
citedby = {0},
pages = {161-174},
booktitle = {Grammatical Inference: Algorithms and Applications, 8th International Colloquium, ICGI 2006, Tokyo, Japan, September 20-22, 2006, Proceedings},
editor = {Yasubumi Sakakibara and Satoshi Kobayashi and Kengo Sato and Tetsuro Nishino and Etsuji Tomita},
volume = {4201},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-45264-8},
}