Synchronizing automata with finitely many minimal synchronizing words
نویسندگان
چکیده
منابع مشابه
Synchronizing Automata over Nested Words
We extend the concept of a synchronizing word from finitestate automata (DFA) to nested word automata (NWA): A well-matched nested word is called synchronizing if it resets the control state of any configuration, i.e., takes the NWA from all control states to a single control state. We show that although the shortest synchronizing word for an NWA, if it exists, can be (at most) exponential in t...
متن کاملSynchronizing automata and the language of minimal reset words
We study a connection between synchronizing automata and its set M of minimal reset words, i.e., such that no proper factor is a reset word. We first show that any synchronizing automaton having the set of minimal reset words whose set of factors does not contain a word of length at most 1 4 min{|u| : u ∈ I} + 1 16 has a reset word of length at most (n − 1 2 ) 2. In the last part of the paper w...
متن کاملFinitely Generated Ideal Languages and Synchronizing Automata
We study representations of ideal languages by means of strongly connected synchronizing automata. For every finitely generated ideal language L we construct such an automaton with at most 2 states, where n is the maximal length of words in L. Our constructions are based on the De Bruijn graph.
متن کاملOn the Minimal Reset Words of Synchronizing Automata
Cerny’s conjecture is a 50 year old conjecture which concerns the combinatoral field of synchronizing automata. In particular, it postulates that the maximal length of the minimal reset word among all n-state automata is (n − 1). We present a proof for Pin’s Theorem, which applies Cerny’s conjecture to p-state automata consisting of a cycle and a nonpermutation, where p ≥ 3 is an odd prime. We ...
متن کاملInfinite Synchronizing Words for Probabilistic Automata
Probabilistic automata are finite-state automata where the transitions are chosen according to fixed probability distributions. We consider a semantics where on an input word the automaton produces a sequence of probability distributions over states. An infinite word is accepted if the produced sequence is synchronizing, i.e. the sequence of the highest probability in the distributions tends to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2011
ISSN: 0890-5401
DOI: 10.1016/j.ic.2010.11.020