#### Filter Results:

#### Publication Year

2010

2016

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

We present several infinite series of synchronizing automata for which the minimum length of reset words is close to the square of the number of states. All these automata are tightly related to primitive digraphs with large exponent. 1 Background and the structure of the paper This paper has arisen from our attempts to find a theoretical explanation for… (More)

We present several infinite series of synchronizing automata for which the minimum length of reset words is close to the square of the number of states. These automata are closely related to primitive digraphs with large exponent. A complete deterministic finite automaton (DFA) is a triple A = Q, Σ, δ, where Q and Σ are finite sets called the state set and… (More)

We study ideal languages generated by a single word. We provide an algorithm to construct a strongly connected synchronizing automaton for which such a language serves as the language of synchronizing words. Also we present a compact formula to calculate the syntactic complexity of this language.

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 n states, where n is the maximal length of words in L. Our constructions are based on the De Bruijn graph.

We present several series of synchronizing automata with multiple parameters, generalizing previously known results. Let p and q be two arbitrary co-prime positive integers, q > p. We describe reset thresholds of the colorings of primitive digraphs with exactly one cycle of length p and one cycle of length q. Also, we study reset thresholds of the colorings… (More)

For each odd n ≥ 5 we present a synchronizing Eulerian automaton with n states for which the minimum length of reset words is equal to n 2 −3n+4 2. We also discuss various connections between the reset threshold of a synchronizing automaton and a sequence of reachability properties in its underlying graph. A complete deterministic finite automaton A is… (More)

A finite set S of words over the alphabet Σ is called non-complete if Fact(S *) = Σ *. A word w ∈ Σ * \ Fact(S *) is said to be uncompletable. We present a series of non-complete sets S k whose minimal uncompletable words have length 5k 2 − 17k + 13, where k ≥ 4 is the maximal length of words in S k. This is an infinite series of counterexamples to… (More)

A set of nonnegative matrices M = {M 1 , M 2 ,. .. , M k } is called primitive if there exist indices im is positive (i.e. has all its entries > 0). The length of the shortest such product is called the exponent of M. The concept of primitive sets of matrices comes up in a number of problems within control theory, non-homogeneous Markov chains, automata… (More)

An automaton is synchronizing if there exists a word that sends all states of the automaton to a single state. A coloring of a digraph with a fixed out-degree k is a distribution of k labels over the edges resulting in a deterministic finite automaton. The famous road coloring theorem states that every primitive digraph has a synchronizing coloring. We… (More)