SOME RESULTS ON ČERNÝ TYPE PROBLEMS FOR TRANSFORMATION SEMIGROUPS
From MaRDI portal
Publication:3552217
DOI10.1142/9789812702616_0002zbMath1189.20060MaRDI 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
68Q45: Formal languages and automata
20M20: Semigroups of transformations, relations, partitions, etc.
20M35: Semigroups in automata theory, linguistics, etc.
Related Items
Способ решения краевых задач с неявным применением рядов Тейлора, On the Interplay Between Černý and Babai’s Conjectures, Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees, Groups synchronizing a transformation of non-uniform kernel, The Černý conjecture for one-cluster automata with prime length cycle, Synchronization, A series of slowly synchronizing automata with a zero state over a small alphabet, Careful synchronization of partial deterministic finite automata, Černý's conjecture and group representation theory, THE AVERAGING TRICK AND THE ČERNÝ CONJECTURE, Primitive groups, graph endomorphisms and synchronization, Synchronizing Automata and the Černý Conjecture, Representation theory of finite semigroups, semigroup radicals and formal language theory, Matrix Mortality and the Černý-Pin Conjecture