@inproceedings{5c8f1beb84ad4722b87333957bfbb021,
title = "Bounded Bi-ideals and linear recurrence",
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 = "Bounded bi-ideal, Combinatorics on words, Completely bounded bi-ideal, Linear recurrence",
author = "Inese Berziņa and Janis Buls and Raivis Bets",
year = "2013",
doi = "10.1109/SYNASC.2013.57",
language = "English",
isbn = "9781479930357",
series = "Proceedings - 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2013",
publisher = "IEEE Computer Society",
pages = "383--390",
booktitle = "Proceedings - 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2013",
address = "United States",
note = "15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2013 ; Conference date: 23-09-2013 Through 26-09-2013",
}