Inferring Uniquely Terminating Regular Languages from Positive Data

@article{Mkinen1997InferringUT,
  title={Inferring Uniquely Terminating Regular Languages from Positive Data},
  author={Erkki M{\"a}kinen},
  journal={Inf. Process. Lett.},
  year={1997},
  volume={62},
  pages={57-60}
}
We define a new subclass of regular languages, called uniquely terminating regular languages, which can be inferred from positive data. The class of uniquely terminating regular languages and the previously known subclasses of regular languages inferable from positive data are incomparable. 

Figures and Topics from this paper.

Explore Further: Topics Discussed in This Paper

Citations

Publications citing this paper.
SHOWING 1-2 OF 2 CITATIONS

A Note on Inferring Uniquely Terminating Code Languages

VIEW 6 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

References

Publications referenced by this paper.