Synchronizing automata with a letter of deficiency 2 / Ananichev D. S.,Volkov M. V.,Zaks Yu. I. // THEORETICAL COMPUTER SCIENCE. - 2007. - V. 376, l. 1-2. - P. 30-41.

ISSN/EISSN:

0304-3975 / нет данных

Type:

Article; Proceedings Paper

Abstract:

We present two infinite series of synchronizing automata with a letter of deficiency 2 whose shortest reset words are longer than those for synchronizing automata obtained by a straightforward modification of Cerny's construction. (C) 2007 Elsevier B.V. All rights reserved.

Author keywords:

deterministic finite automaton; synchronizing automaton; reset word; Cemy conjecture; deficiency of a transformation MONOTONIC AUTOMATA; SEQUENCES; CONJECTURE

DOI:

10.1016/j.tcs.2007.01.010

Web of Science ID:

ISI:000246375200004

Соавторы в МНС:

Другие поля

Поле	Значение
Month	MAY 10
Note	10th International Conference on Developments in Language Theory, Univ Calif Santa Barbara, Santa Barbara, CA, JUN 26-29, 2006
Organization	Univ Calif Santa Barbara, Comp Sci Dept; Univ Calif Santa Barbara, Coll Engn; Univ Calif Santa Barbara, Grad Div; Ask com; Citrix; Google
Publisher	ELSEVIER SCIENCE BV
Address	PO BOX 211, 1000 AE AMSTERDAM, NETHERLANDS
Language	English
Keywords-Plus	MONOTONIC AUTOMATA; SEQUENCES; CONJECTURE
Research-Areas	Computer Science
Web-of-Science-Categories	Computer Science, Theory \& Methods
Author-Email	Dmitry.Ananichev@usu.ru Mikhail.Volkov@usu.ru zaksjulia@r66.ru
ResearcherID-Numbers	Volkov, Mikhail/F-1407-2014
ORCID-Numbers	Volkov, Mikhail/0000-0002-9327-243X
Number-of-Cited-References	15
Usage-Count-Since-2013	4
Journal-ISO	Theor. Comput. Sci.
Doc-Delivery-Number	166JO