Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-15T20:04:37.543Z Has data issue: false hasContentIssue false
  • English
  • Français

From Bi-ideals to Periodicity

Published online by Cambridge University Press:  03 June 2008

Jānis Buls and
Aivars Lorencs
Jānis Buls
Affiliation:
Department of Mathematics, University of Latvia, Raiņa bulvāris 19, Rīga, 1586, Latvia; buls@fmf.lu.lv; web site:
Aivars Lorencs
Affiliation:
Institute of Electronics and Computer Science, Dzērbenes street 14, Rīga, 1006, Latvia; lorencs@edi.lv
Get access

Abstract

The necessary and sufficient conditions are extracted for periodicity of bi-ideals. They cover infinitely and finitely generated bi-ideals.

Keywords

Periodic wordsbi-idealsthe sequence generates the bi-idealfinitely generated bi-ideals

Information

Type
Research Article
Information
RAIRO - Theoretical Informatics and Applications , Volume 42 , Issue 3: JM'06 , July 2008, pp. 467 - 475
Copyright
© EDP Sciences, 2008

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

Bean, D.B., Ehrenfeucht, A.E. and McNulty, G.. Avoidable patterns in strings of symbols. Pacific J. Math. 85 (1979) 261–294. CrossRef
J. Berstel, J. Karhumäki. Combinatorics on Words — A Tutorial. TUCS Technical Report (No. 530, June) (2003).
M. Coudrain and M.P. Schützenberger. Une condition de finitude des monoïdes finiment engendrés. C.R. Acad. Sci. Paris, Sér. A 262 (1966) 1149–1151.
Crochemore, M. and Rytter, W.. Squares, cubes, and time-space efficient string searchinng. Algorithmica 13 (1995) 405–425. CrossRef
Fine, N.J., Wilf, H.S.. (1965) Uniqueness theorem for periodic functions. Proc. Amer. Math. Soc. 16 (1965) 109–114. CrossRef
D. Gusfield. Algorithms on Strings, Trees, and Sequences. Cambridge University Press (1997).
N. Jacobson. Structure of Rings. American Mathematical Society, Providence, RI (1964).
M. Lothaire. Combinatorics on Words. Encyclopedia of Mathematics and its Applications, Vol. 17. Addison-Wesley, Reading, Massachusetts (1983).
M. Lothaire. Algebraic Combinatorics on Words. Encyclopedia of Mathematics and its Applications, Vol. 90. Cambridge University Press, Cambridge (2002).
Aldo de Luca, Stefano Varricchio. Finiteness and Regularity in Semigroups and Formal Languages. Springer-Verlag, Berlin, Heidelberg (1999).
R.A. Rueppel. Analysis and Design of Stream Ciphers. Springer-Verlag, Berlin (1986).
I. Simon. Infinite words and a theorem of Hindman. Rev. Math. Appl. 9 (1988) 97–104.
J.A. Storer. Data compression: methods and theory. Computer Science Press, Rockville, MD (1988).
A.I. Zimin. Blocking sets of terms. Matem. sb., 119, 363–375 (Russian) (1982).