1. An algebraic approach to data languages and timed languages
- Author
-
Bouyer, Patricia, Petit, Antoine, and Thérien, Denis
- Subjects
- *
ENGLISH language , *AUTOMATION - Abstract
Algebra offers an elegant and powerful approach to understand regular languages and finite automata. Such framework has been notoriously lacking for timed languages and timed automata. We introduce the notion of monoid recognizability for data languages, which includes timed languages as special case, in a way that respects the spirit of the classical situation. We study closure properties and hierarchies in this model and prove that emptiness is decidable under natural hypotheses. Our class of recognizable languages properly includes many families of deterministic timed languages that have been proposed until now, and the same holds for non-deterministic versions. [Copyright &y& Elsevier]
- Published
- 2003
- Full Text
- View/download PDF