@inproceedings{a9b2da1546c748f1b051a211e9b82dce,
title = "Partial finitely generated Bi-ideals",
abstract = "Partial words have been studied by Blanchet-Sadri et al., but bi-ideals or reccurrent words have been studied for centuries by many researchers. This paper gives a solution for some problems for partial reccurrent words. This paper gives an algorithm for a given finitely generated bi-ideal, how to construct a new basis of ultimately finitely generated bi-ideal, which generates the same given bi-ideal. The paper states that it is always possible to find a basis for a given finitely generated bi-ideal. The main results of this paper are presented in third section. At first, we show that if two irreduciable bi-ideals are different, they will differ in infinitely many places. This led to the statement that it is possible to fill the finite number of holes for a given finitely generated bi-ideal, but a counterexample shows that it is not possible for infinitely many holes.",
keywords = "Bi-ideals, filling of holes, irreducible basis, partial words",
author = "Raivis Bets and Janis Buls",
note = "Publisher Copyright: {\textcopyright} 2016 IEEE.; 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2016 ; Conference date: 24-09-2016 Through 27-09-2016",
year = "2017",
month = jan,
day = "23",
doi = "10.1109/SYNASC.2016.065",
language = "English",
series = "Proceedings - 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2016",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "379--383",
editor = "James Davenport and Dana Petcu and Tudor Jebelean and Viorel Negru and Watt, \{Stephen M.\} and Tetsuo Ida and Daniela Zaharie",
booktitle = "Proceedings - 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2016",
address = "United States",
}