Abstract
The notion of infinite traces has been proposed to generalize both the finite traces defined by Mzurkiewicz and the infinite words. The fanfily of recognizable languages of infinite traces has been introduced by means of recognizing morphisms and characterized by c-rational expressions. In this paper, we provide another characterization of this family using asynchronous cellular automata (which carry the most intuitive idea of finite state concurrent machines). To this purpose, we give effective constructions for c-rational operations on these automata, which are of independent interest.
Cite
CITATION STYLE
Gastin, P., & Petit, A. (1992). Asynchronous cellular automata for infinite traces. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 623 LNCS, pp. 583–594). Springer Verlag. https://doi.org/10.1007/3-540-55719-9_106
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
