Mind change complexity of inferring unbounded unions of restricted pattern languages from positive data

Matthew de Brecht, Akihiro Yamamoto. Mind change complexity of inferring unbounded unions of restricted pattern languages from positive data. Theoretical Computer Science, 411(7-9):976-985, 2010. [doi]

@article{BrechtY10-0,
  title = {Mind change complexity of inferring unbounded unions of restricted pattern languages from positive data},
  author = {Matthew de Brecht and Akihiro Yamamoto},
  year = {2010},
  doi = {10.1016/j.tcs.2009.11.004},
  url = {http://dx.doi.org/10.1016/j.tcs.2009.11.004},
  tags = {data-flow language, pattern language, data-flow},
  researchr = {https://researchr.org/publication/BrechtY10-0},
  cites = {0},
  citedby = {0},
  journal = {Theoretical Computer Science},
  volume = {411},
  number = {7-9},
  pages = {976-985},
}