Learning a Subclass of Regular Patterns in Polynomial Time

Cite

Text

Case et al. "Learning a Subclass of Regular Patterns in Polynomial Time." International Conference on Algorithmic Learning Theory, 2003. doi:10.1007/978-3-540-39624-6_19

Markdown

[Case et al. "Learning a Subclass of Regular Patterns in Polynomial Time." International Conference on Algorithmic Learning Theory, 2003.](https://mlanthology.org/alt/2003/case2003alt-learning/) doi:10.1007/978-3-540-39624-6_19

BibTeX

@inproceedings{case2003alt-learning,
  title     = {{Learning a Subclass of Regular Patterns in Polynomial Time}},
  author    = {Case, John and Jain, Sanjay and Reischuk, Rüdiger and Stephan, Frank and Zeugmann, Thomas},
  booktitle = {International Conference on Algorithmic Learning Theory},
  year      = {2003},
  pages     = {234-246},
  doi       = {10.1007/978-3-540-39624-6_19},
  url       = {https://mlanthology.org/alt/2003/case2003alt-learning/}
}