Synchronizing monotonic automata / Ananichev DS,Volkov MV // . - 2003. - V. 2710, l. . - P. 111-121.

ISSN/EISSN:

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

Type:

Article; Proceedings Paper

Abstract:

We show that if the state set Q of a synchronizing automaton A = admits a linear order such that for each letter a is an element of Sigma the transformation delta(\_, a) of Q preserves this order, then A possesses a reset word of length \textbackslash{}Q\textbackslash{} - 1. We also consider two natural generalizations of the notion of a reset word and provide for them results of a similar flavour.

Author keywords:

нет данных

DOI:

нет данных

Web of Science ID:

ISI:000187325200008

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

Другие поля

Поле	Значение
Editor	Esik, Z and Fulop, Z
Booktitle	DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS
Series	LECTURE NOTES IN COMPUTER SCIENCE
Note	7th International Conference on Developments in Language Theory, SZEGED, HUNGARY, JUL 07-11, 2003
Organization	Univ Szeged, Dept Informat; Min Educ Hungary; Fund Szeged; Hewlett-Packard Hungary Ltd
Publisher	SPRINGER-VERLAG BERLIN
Address	HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
Language	English
ISBN	3-540-40434-1
Research-Areas	Computer Science
Web-of-Science-Categories	Computer Science, Software Engineering; Computer Science, Theory \& Methods
ResearcherID-Numbers	Volkov, Mikhail/F-1407-2014
ORCID-Numbers	Volkov, Mikhail/0000-0002-9327-243X
Number-of-Cited-References	8
Doc-Delivery-Number	BY03P