Synchronizing Automata and the Cerny Conjecture / Volkov Mikhail V. // . - 2008. - V. 5196, l. . - P. 11-27.

ISSN/EISSN:

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

Type:

Proceedings Paper

Abstract:

We survey several results and open problems related to synchronizing automata. In particular, we discuss some recent advances towards a solution of the Cerny conjecture.

Author keywords:

MONOTONIC AUTOMATA; COMPUTING MACHINE; FINITE AUTOMATA; POLYGONAL PARTS; SEQUENCES; LENGTH

DOI:

10.1007/978-3-540-88282-4\_4

Web of Science ID:

ISI:000261729900004

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

—

Другие поля

Поле	Значение
Editor	MartinVide, C and Otto, F and Fernau, H
Booktitle	LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS
Series	Lecture Notes in Computer Science
Note	2nd International Conference on Language and Automata Theory and Applications, Tarragona, SPAIN, MAR 13-19, 2008
Organization	Fund Caixa Tarragona
Publisher	SPRINGER-VERLAG BERLIN
Address	HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
Language	English
ISBN	978-3-540-88281-7
Keywords-Plus	MONOTONIC AUTOMATA; COMPUTING MACHINE; FINITE AUTOMATA; POLYGONAL PARTS; SEQUENCES; LENGTH
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	52
Usage-Count-Since-2013	4
Doc-Delivery-Number	BIP88