Learning Regular Languages Using Non Deterministic Finite Automata

François Denis, Aurélien Lemay, Alain Terlutte. Learning Regular Languages Using Non Deterministic Finite Automata. In Arlindo L. Oliveira, editor, Grammatical Inference: Algorithms and Applications, 5th International Colloquium, ICGI 2000, Lisbon, Portugal, September 11-13, 2000, Proceedings. Volume 1891 of Lecture Notes in Computer Science, pages 39-50, Springer, 2000.

@inproceedings{DenisLT00,
  title = {Learning Regular Languages Using Non Deterministic Finite Automata},
  author = {François Denis and Aurélien Lemay and Alain Terlutte},
  year = {2000},
  researchr = {https://researchr.org/publication/DenisLT00},
  cites = {0},
  citedby = {0},
  pages = {39-50},
  booktitle = {Grammatical Inference: Algorithms and Applications, 5th International Colloquium, ICGI 2000, Lisbon, Portugal, September 11-13, 2000, Proceedings},
  editor = {Arlindo L. Oliveira},
  volume = {1891},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-41011-2},
}