Synchronizing automata preserving a chain of partial orders / Volkov M. V. // THEORETICAL COMPUTER SCIENCE. - 2009. - V. 410, l. 37. - P. 3513-3519.

ISSN/EISSN:

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

Type:

Article; Proceedings Paper

Abstract:

We present a new class of automata which strictly contains the class of aperiodic automata and shares with the latter certain synchronization properties. In particular, every strongly connected automaton in this new class is synchronizing and has a synchronizing word of length {[}n(n+1)/6] where n is the number of states of the automaton. (C) 2009 Elsevier B.V. All rights reserved.

Author keywords:

Synchronizing automata; Aperiodic automata; Weakly monotonic automata MONOTONIC AUTOMATA; CERNY CONJECTURE; SEQUENCES

DOI:

10.1016/j.tcs.2009.03.021

Web of Science ID:

ISI:000269304000009

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

—

Другие поля

Поле	Значение
Month	SEP 1
Note	12th International Conference on Implementation and Application of Automata, Czech Tech Univ, Prague, CZECH REPUBLIC, JUL 16-18, 2007
Organization	IBM Czech Republic; Sun Microsyst Czech
Publisher	ELSEVIER SCIENCE BV
Address	PO BOX 211, 1000 AE AMSTERDAM, NETHERLANDS
Language	English
Keywords-Plus	MONOTONIC AUTOMATA; CERNY CONJECTURE; SEQUENCES
Research-Areas	Computer Science
Web-of-Science-Categories	Computer Science, Theory \& Methods
Author-Email	Mikhail.Volkov@usu.ru
ResearcherID-Numbers	Volkov, Mikhail/F-1407-2014
ORCID-Numbers	Volkov, Mikhail/0000-0002-9327-243X
Number-of-Cited-References	17
Usage-Count-Since-2013	1
Journal-ISO	Theor. Comput. Sci.
Doc-Delivery-Number	487VA