Learning Deterministic Finite Automata from Infinite Alphabets

Gaetano Pellegrino, Christian A. Hammerschmidt, Qin Lin, Sicco Verwer. Learning Deterministic Finite Automata from Infinite Alphabets. In Sicco Verwer, Menno van Zaanen, Rick Smetsers, editors, Proceedings of the 13th International Conference on Grammatical Inference, ICGI 2016, Delft, The Netherlands, October 5-7, 2016. Volume 57 of JMLR Workshop and Conference Proceedings, pages 120-131, JMLR.org, 2016. [doi]

@inproceedings{PellegrinoHLV16,
  title = {Learning Deterministic Finite Automata from Infinite Alphabets},
  author = {Gaetano Pellegrino and Christian A. Hammerschmidt and Qin Lin and Sicco Verwer},
  year = {2016},
  url = {http://jmlr.org/proceedings/papers/v57/pellegrino16.html},
  researchr = {https://researchr.org/publication/PellegrinoHLV16},
  cites = {0},
  citedby = {0},
  pages = {120-131},
  booktitle = {Proceedings of the 13th International Conference on Grammatical Inference, ICGI 2016, Delft, The Netherlands, October 5-7, 2016},
  editor = {Sicco Verwer and Menno van Zaanen and Rick Smetsers},
  volume = {57},
  series = {JMLR Workshop and Conference Proceedings},
  publisher = {JMLR.org},
}