Grammatical Inference: An Old and New Paradigm
Abstract
In this paper, we provide a survey of recent advances in the field “grammatical inference” with a particular emphasis on the results concerning the learnability of target classes represented by deterministic finite automata, context-free grammars, hidden Markov models, stochastic context-free grammars, simple recurrent neural networks, and casebased representations.
Cite
Text
Sakakibara. "Grammatical Inference: An Old and New Paradigm." International Conference on Algorithmic Learning Theory, 1995. doi:10.1007/3-540-60454-5_25Markdown
[Sakakibara. "Grammatical Inference: An Old and New Paradigm." International Conference on Algorithmic Learning Theory, 1995.](https://mlanthology.org/alt/1995/sakakibara1995alt-grammatical/) doi:10.1007/3-540-60454-5_25BibTeX
@inproceedings{sakakibara1995alt-grammatical,
title = {{Grammatical Inference: An Old and New Paradigm}},
author = {Sakakibara, Yasubumi},
booktitle = {International Conference on Algorithmic Learning Theory},
year = {1995},
pages = {1-24},
doi = {10.1007/3-540-60454-5_25},
url = {https://mlanthology.org/alt/1995/sakakibara1995alt-grammatical/}
}