Abstract
We investigate the relationships between two types of words that have recently arisen in studying "black-box" versions of the famous C? ernyproblem on synchronizing automata. Considering the languages formed by words of each of these types, we verify that one of them is regular while the other is not, thus showing that the two notions in question are different. We also discuss certain open problems concerning words of minimum length in these languages. © Springer-Verlag Berlin Heidelberg 2002.
Cite
CITATION STYLE
Ananichev, D. S., & Volkov, M. V. (2002). Collapsingwords vs. synchronizingwords. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2295 LNCS, pp. 166–174). Springer Verlag. https://doi.org/10.1007/3-540-46011-x_13
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
