Abstract
We present a subset automaton construction for asynchronous cellular automata. This provides an answer to the problem of direct determinization for asynchronous cellular automata for finite traces, which has been open for several years. We use the subset automaton construction in order to extend Klarlund’s progress measure technique of complementation to non-deterministic asynchronous cellular Büchi automata for infinite traces. Our automaton for the complement (as well as the subset automaton) has 2°(N|∑|) global states.
Cite
CITATION STYLE
Muscholl, A. (1994). On the complementation of Büchi asynchronous cellular automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 820 LNCS, pp. 142–153). Springer Verlag. https://doi.org/10.1007/3-540-58201-0_64
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
