Slowly synchronizing automata with zero and incomplete sets

Autor: Pribavkina, E. V.

Using combinatorial properties of incomplete sets in a free monoid we construct a series of n-state deterministic automata with zero whose shortest synchronizing word has length n^2/4+n/2-1.
Comment: 9 pages, 6 figures

Externí odkaz: http://arxiv.org/abs/0907.4576

On Non-complete Sets and Restivo's Conjecture

Autor: Gusev, V. V., Pribavkina, E. V.

Publikováno v: Lect. Notes Comput. Sci.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

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+1

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od_______917::07afe2da912182ab0a15d0da5c2dc936
https://hdl.handle.net/10995/111367

On Some Properties of the Language of 2-Collapsing Words.

Autor: Felice, Clelia, Restivo, Antonio, Pribavkina, E. V.

Publikováno v: Developments in Language Theory (9783540265467); 2005, p374-384, 11p

Predicting the yield of coke and coking byproducts.

Autor: Rubchevskii, V., Chernyshov, Yu., Ovchinnikova, S., Kompaniets, A., Drozdnik, I., Miroshnichenko, D., Golovko, M., Pribavkina, E.

Publikováno v: Coke & Chemistry; Apr2009, Vol. 52 Issue 4, p137-142, 6p