A logical characterization of data languages

  title={A logical characterization of data languages},
  author={Patricia Bouyer},
  journal={Inf. Process. Lett.},
The ideal case of formal languages. In the formal languages framework, the class of regular languages can be characterized in various ways: finite automata, rational expressions, monadic second-order logic, extended temporal logics, finite monoids... (see e.g. [RS97]). Among all these equivalences, the logical characterization is of particular interest since many subclasses of regular languages (like star-free languages or locally threshold testable languages) can be exactly described through… CONTINUE READING


Publications citing this paper.