Asynchronous automata versus asynchronous cellular automata
- 26 September 1994
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 132 (1-2) , 179-207
- https://doi.org/10.1016/0304-3975(94)90232-1
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- On the existence of the minimum asynchronous automaton and on decision problems for unambiguous regular trace languagesPublished by Springer Nature ,2006
- Asynchronous Mappings and Asynchronous Cellular AutomataInformation and Computation, 1993
- Membership problems for regular and context-free trace languagesInformation and Computation, 1989
- 2-Asynchronous automataTheoretical Computer Science, 1988
- On recognizable subsets of free partially commutative monoidsTheoretical Computer Science, 1988
- Theory of tracesTheoretical Computer Science, 1988
- Mixed product and asynchronous automataTheoretical Computer Science, 1986
- Recognizable subsets of some partially abelian monoidsTheoretical Computer Science, 1985
- Linear Automaton TransformationsProceedings of the American Mathematical Society, 1958
- Linear automaton transformationsProceedings of the American Mathematical Society, 1958