Combinatorical and Algebraic Structures Seminar
Session details
| Date: | 14.2.2012 |
| Speaker: | Karel Klouda, FIT, České vysoké učení technické v Praze |
| Title: | Test of circularity |
| Abstract: | We present a simple finite algorithm to test whether a given finite set of words forms a circular code or not. A by-product of this algorithm is a list of non-synchronized circular words and a rather accurate estimate of the synchronizing delay. Further we show that the same algorithm can be enhanced so that is is usable also for testing circularity and injectivity of a wide class of morphisms. An efficient test of circularity was the last ingredient missing to construct a finite algorithm that describes all bispecial factors of a given circular and non-pushy morphism. |
Return to index.
last update: 27.9.2007, webmaster: Petr Ambrož