Notes on finite asynchronous automata
نویسندگان
چکیده
منابع مشابه
Notes on Learning Probabilistic Automata
Alberto Apostolico y Probabilistic models of various classes of sources are developed in the context of coding and compression as well as in machine learning and classi cation. In the rst domain, the repetitive structures of substrings are regarded as redundancies and sought to be removed. In the second, repeated subpatterns are unveiled as carriers of information and structure. In both context...
متن کاملMultidimensional fuzzy finite tree automata
This paper introduces the notion of multidimensional fuzzy finite tree automata (MFFTA) and investigates its closure properties from the area of automata and language theory. MFFTA are a superclass of fuzzy tree automata whose behavior is generalized to adapt to multidimensional fuzzy sets. An MFFTA recognizes a multidimensional fuzzy tree language which is a regular tree language so that for e...
متن کاملDeterminizing Asynchronous Automata on Infinite Inputs
Asynchronous automata are a natural distributed machine model for recognizing trace languages—languages defined over an alphabet equipped with an independence relation. To handle infinite traces, Gastin and Petit introduced Büchi asynchronous automata, which accept precisely the class of ω-regular trace languages. Like their sequential counterparts, these automata need to be non-deterministic i...
متن کاملOn the Control of Asynchronous Automata
The decidability of the distributed version of the Ramadge and Wonham controller synthesis problem [12], where both the plant and the controllers are modelled as Zielonka automata [13,1] and the controllers have causal memory is a challenging open problem [8,9]. There exists three classes of plants for which the existence of a correct controller with causal memory has been shown decidable: when...
متن کاملon residually finite semigroups of cellullar automata
we prove that if $m$ is a monoid and $a$ a finite set with more than one element, then the residual finiteness of $m$ is equivalent to that of the monoid consisting of all cellular automata over $m$ with alphabet $a$.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 1987
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita/1987210200991