Deterministic asynchronous automata for infinite traces
- 1 April 1994
- journal article
- Published by Springer Nature in Acta Informatica
- Vol. 31 (4) , 379-397
- https://doi.org/10.1007/bf01178512
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- On the concatenation of infinite tracesPublished by Springer Nature ,2005
- Recognizable and rational languages of finite and infinite tracesPublished by Springer Nature ,2005
- The poset of infinitary tracesTheoretical Computer Science, 1993
- Asynchronous Mappings and Asynchronous Cellular AutomataInformation and Computation, 1993
- Asynchronous cellular automata for infinite tracesPublished by Springer Nature ,1992
- A Kleene theorem for infinite trace languagesPublished by Springer Nature ,1991
- A metric for tracesInformation Processing Letters, 1990
- Combinatorics on TracesPublished by Springer Nature ,1990
- A syntactic congruence for rational ω-languagesTheoretical Computer Science, 1985
- Problèmes combinatoires de commutation et réarrangementsLecture Notes in Mathematics, 1969