Synchronizing automata with a letter of deficiency 2 / Ananichev D. S.,Volkov M. V.,Zaks Yu. I. // . - 2006. - V. 4036, l. . - P. 433-442.

ISSN/EISSN:
0302-9743 / нет данных
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.
Author keywords:
MONOTONIC AUTOMATA; SEQUENCES
DOI:
нет данных
Web of Science ID:
ISI:000239454100039
Соавторы в МНС:
Другие поля
Поле Значение
Editor Ibarra, OH and Dang, Z
Booktitle DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS
Series LECTURE NOTES IN COMPUTER SCIENCE
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 SPRINGER-VERLAG BERLIN
Address HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
Language English
ISBN 3-540-35428-X
Keywords-Plus MONOTONIC AUTOMATA; SEQUENCES
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 13
Doc-Delivery-Number BET64