Title :
Bounded Bi-ideals and Linear Recurrence
Author :
Berzina, Inese ; Buls, Janis ; Bets, Raivis
Author_Institution :
Fac. of Phys. & Math., Univ. of Latvia Riga, Riga, Latvia
Abstract :
Bounded bi-ideals are a subclass of uniformly recurrent words. We introduce the notion of completely bounded bi-ideals by imposing a restriction on their generating base sequences. We prove that a bounded bi-ideal is linearly recurrent if and only if it is completely bounded.
Keywords :
combinatorial mathematics; random sequences; set theory; base sequence generation; completely bounded bi-ideals; linear recurrence; uniformly recurrent words; Educational institutions; Electronic mail; Generators; Mathematics; Multiaccess communication; Physics; Scientific computing; bounded bi-ideal; combinatorics on words; completely bounded bi-ideal; linear recurrence;
Conference_Titel :
Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2013 15th International Symposium on
Conference_Location :
Timisoara
Print_ISBN :
978-1-4799-3035-7
DOI :
10.1109/SYNASC.2013.57
