SOME RESULTS ON ČERNÝ TYPE PROBLEMS FOR TRANSFORMATION SEMIGROUPS
From MaRDI portal
Publication:3552217
DOI10.1142/9789812702616_0002zbMath1189.20060OpenAlexW2333783987MaRDI QIDQ3552217
D. S. Ananichev, Mikhail V. Volkov
Publication date: 14 April 2010
Published in: Semigroups and Languages (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/9789812702616_0002
Formal languages and automata (68Q45) Semigroups of transformations, relations, partitions, etc. (20M20) Semigroups in automata theory, linguistics, etc. (20M35)
Related Items
THE AVERAGING TRICK AND THE ČERNÝ CONJECTURE, Careful synchronization of partial deterministic finite automata, Groups synchronizing a transformation of non-uniform kernel, Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees, Primitive groups, graph endomorphisms and synchronization, On the Interplay Between Černý and Babai’s Conjectures, Synchronizing Automata and the Černý Conjecture, Synchronization, A series of slowly synchronizing automata with a zero state over a small alphabet, Černý's conjecture and group representation theory, The Černý conjecture for one-cluster automata with prime length cycle, Representation theory of finite semigroups, semigroup radicals and formal language theory, Способ решения краевых задач с неявным применением рядов Тейлора, Matrix Mortality and the Černý-Pin Conjecture
