Ordered Term Tree Languages Which Are Polynomial Time Inductively Inferable from Positive Data

Suzuki et al. "Ordered Term Tree Languages Which Are Polynomial Time Inductively Inferable from Positive Data." International Conference on Algorithmic Learning Theory, 2002. doi:10.1007/3-540-36169-3_17

[Suzuki et al. "Ordered Term Tree Languages Which Are Polynomial Time Inductively Inferable from Positive Data." International Conference on Algorithmic Learning Theory, 2002.](https://mlanthology.org/alt/2002/suzuki2002alt-ordered/) doi:10.1007/3-540-36169-3_17

@inproceedings{suzuki2002alt-ordered,
  title     = {{Ordered Term Tree Languages Which Are Polynomial Time Inductively Inferable from Positive Data}},
  author    = {Suzuki, Yusuke and Shoudai, Takayoshi and Uchida, Tomoyuki and Miyahara, Tetsuhiro},
  booktitle = {International Conference on Algorithmic Learning Theory},
  year      = {2002},
  pages     = {188-202},
  doi       = {10.1007/3-540-36169-3_17},
  url       = {https://mlanthology.org/alt/2002/suzuki2002alt-ordered/}
}