An Algebraic Characterization of Data and Timed Languages
An Algebraic Characterization of Data and Timed Languages
复制标题
数据和定时语言的代数表征
DOI：
10.1007/3-540-44685-0_17
复制
发表时间：
2001
期刊：
影响因子：
--
通讯作者：
D. Thérien
中科院分区：
文献类型：
--
作者：
P. Bouyer;A. Petit;D. Thérien
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 include 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.
