Selected papers that cite this one
- Ganesh Baliga, John Case, and Sanjay Jain. The synthesis of language learners. Accepted for publication in Information and Computation. Final manuscript received for publication June 25, 1998.
- Satoshi Kobayashi and Takashi Yokomori. Learning approximately regular languages with reversible languages. Theoretical Computer Science, 174(1-2):251-257, 15 March 1997. Note.
- Takeshi Koshiba, Erkki Mäkinen, and Yuji Takada. Learning deterministic even linear languages from positive examples. Theoretical Computer Science, 185(1):63-79, 10 October 1997.
- Erkki Mäkinen. Inferring uniquely terminating regular languages from positive data. Information Processing Letters, 62(2):57-60, 28 April 1997.
- Ronald L. Rivest and Robert E. Schapire. Diversity-based inference of finite automata. Journal of the ACM, 41(3):555-589, May 1994.
- Yasubumi Sakakibara. Recent advances of grammatical inference. Theoretical Computer Science, 185(1):15-45, 10 October 1997.
- Yasubumi Sakakibara. Efficient learning of context-free grammars from positive structural examples. Information and Computation, 97(1):23-60, March 1992.
- Yuji Takada. A hierarchy of language families learnable by regular language learning. Information and Computation, 123(1):138-145, 15 November 1995.