• Mathematics, Computer Science
• Published in Inf. Process. Lett. 2002
• DOI:10.1016/S0020-0190(02)00229-6

A logical characterization of data languages

@article{Bouyer2002ALC,
  title={A logical characterization of data languages},
  author={Patricia Bouyer},
  journal={Inf. Process. Lett.},
  year={2002},
  volume={84},
  pages={75-85}
}

• Patricia Bouyer

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

View via Publisher

Alternate Sources

Save to Library

Create Alert

Cite