Inferring Uniquely Terminating Regular Languages from Positive Data

Erkki Mäkinen. Inferring Uniquely Terminating Regular Languages from Positive Data. Inf. Process. Lett., 62(2):57-60, 1997. [doi]

@article{Makinen97:0,
  title = {Inferring Uniquely Terminating Regular Languages from Positive Data},
  author = {Erkki Mäkinen},
  year = {1997},
  doi = {10.1016/S0020-0190(97)00045-8},
  url = {http://dx.doi.org/10.1016/S0020-0190(97)00045-8},
  tags = {data-flow language, data-flow},
  researchr = {https://researchr.org/publication/Makinen97%3A0},
  cites = {0},
  citedby = {0},
  journal = {Inf. Process. Lett.},
  volume = {62},
  number = {2},
  pages = {57-60},
}