Abstract
An action X x A + → X: (x,w) → x*w of the free semigroup A + over the alphabet A is synchronised by a word w ∈ A + if x*w = y*w for all x, y ∈ X. Cerny conjectured that if there is such a w and |X| = n, then there is one of length ≤ (n - 1) 2 . The conjecture remains open, except for particular classes of actions. An action is circular if there is c ∈ A acting as a circular permutation, and biaised if there is b ∈ A with only one x ∈ X such that |x* b -1 |≥ 2. We confirm here Cerny conjecture for biaised circular actions.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Similar Papers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.