Synchronizing automata preserving a chain of partial orders / Volkov Mikhail V. // . - 2007. - V. 4783, l. . - P. 27-37.

ISSN/EISSN:

0302-9743 / нет данных

Type:

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 reset word of length {[}n(n+1)]/6] where n is the number of states of the automaton.

Author keywords:

deterministic finite automaton; synchronizing automaton; Cerny conjecture; congruence on an automaton; weakly monotonic automaton; strongly connected automaton MONOTONIC AUTOMATA; SEQUENCES

DOI:

нет данных

Web of Science ID:

ISI:000252061100005

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

—

Другие поля

Поле	Значение
Editor	Holub, J and Zdarek, J
Booktitle	IMPLEMENTATION AND APPLICATION OF AUTOMATA
Series	LECTURE NOTES IN COMPUTER SCIENCE
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	SPRINGER-VERLAG BERLIN
Address	HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
Language	English
ISBN	978-3-540-76335-2
Keywords-Plus	MONOTONIC AUTOMATA; SEQUENCES
Research-Areas	Computer Science; Mathematics
Web-of-Science-Categories	Computer Science, Theory \& Methods; Mathematics, Applied
ResearcherID-Numbers	Volkov, Mikhail/F-1407-2014
ORCID-Numbers	Volkov, Mikhail/0000-0002-9327-243X
Number-of-Cited-References	14
Doc-Delivery-Number	BHB26