Pāriet uz galveno navigāciju Pāriet uz meklēšanu Pāriet uz galveno saturu

Partial finitely generated Bi-ideals

  • University of Latvia

Zinātniskās darbības rezultāts: Nodaļa grāmatā/enciklopēdijā/konferences krājumā › Konferences zinātniskais raksts › Pētniecība › koleģiāli recenzēts

Kopsavilkums

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.

OriģinālvalodaAngļu
Publikācijas avota nosaukumsProceedings - 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2016
RedaktoriJames Davenport, Dana Petcu, Tudor Jebelean, Viorel Negru, Stephen M. Watt, Tetsuo Ida, Daniela Zaharie
IzdevējsInstitute of Electrical and Electronics Engineers Inc.
Lapas379-383
Lapu skaits5
ISBN (Elektroniski)9781509057078
DOIs
Publikācijas statussPublicēts - 23 janv. 2017
Ārēji publicētsJā
Pasākums18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2016 - Timisoara, Rumānija
Ilgums: 24 sept. 2016 → 27 sept. 2016

Publikāciju sērijas

NosaukumsProceedings - 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2016

Konference

Konference18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2016
Valsts/TeritorijaRumānija
PilsētaTimisoara
Periods24/09/16 → 27/09/16

Nospiedums

Uzziniet vairāk par pētniecības tēmām “Partial finitely generated Bi-ideals”. Kopā tie veido unikālu nospiedumu.

Citēt šo