Polynomial Time Inductive Inference of Regular Term Tree Languages from Positive Data

Cite

Text

Matsumoto et al. "Polynomial Time Inductive Inference of Regular Term Tree Languages from Positive Data." International Conference on Algorithmic Learning Theory, 1997. doi:10.1007/3-540-63577-7_45

Markdown

[Matsumoto et al. "Polynomial Time Inductive Inference of Regular Term Tree Languages from Positive Data." International Conference on Algorithmic Learning Theory, 1997.](https://mlanthology.org/alt/1997/matsumoto1997alt-polynomial/) doi:10.1007/3-540-63577-7_45

BibTeX

@inproceedings{matsumoto1997alt-polynomial,
  title     = {{Polynomial Time Inductive Inference of Regular Term Tree Languages from Positive Data}},
  author    = {Matsumoto, Satoshi and Hayashi, Yukiko and Shoudai, Takayoshi},
  booktitle = {International Conference on Algorithmic Learning Theory},
  year      = {1997},
  pages     = {212-227},
  doi       = {10.1007/3-540-63577-7_45},
  url       = {https://mlanthology.org/alt/1997/matsumoto1997alt-polynomial/}
}