From Bi-ideals to Periodicity

Jānis Buls; Aivars Lorencs

RAIRO - Theoretical Informatics and Applications (2008)

  • Volume: 42, Issue: 3, page 467-475
  • ISSN: 0988-3754

Abstract

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

How to cite

top

Buls, Jānis, and Lorencs, Aivars. "From Bi-ideals to Periodicity." RAIRO - Theoretical Informatics and Applications 42.3 (2008): 467-475. <http://eudml.org/doc/250333>.

@article{Buls2008,
abstract = { The necessary and sufficient conditions are extracted for periodicity of bi-ideals. They cover infinitely and finitely generated bi-ideals. },
author = {Buls, Jānis, Lorencs, Aivars},
journal = {RAIRO - Theoretical Informatics and Applications},
keywords = {Periodic words; bi-ideals; the sequence generates the bi-ideal; finitely generated bi-ideals},
language = {eng},
month = {6},
number = {3},
pages = {467-475},
publisher = {EDP Sciences},
title = {From Bi-ideals to Periodicity},
url = {http://eudml.org/doc/250333},
volume = {42},
year = {2008},
}

TY - JOUR
AU - Buls, Jānis
AU - Lorencs, Aivars
TI - From Bi-ideals to Periodicity
JO - RAIRO - Theoretical Informatics and Applications
DA - 2008/6//
PB - EDP Sciences
VL - 42
IS - 3
SP - 467
EP - 475
AB - The necessary and sufficient conditions are extracted for periodicity of bi-ideals. They cover infinitely and finitely generated bi-ideals.
LA - eng
KW - Periodic words; bi-ideals; the sequence generates the bi-ideal; finitely generated bi-ideals
UR - http://eudml.org/doc/250333
ER -

References

top
  1. D.B. Bean, A.E. Ehrenfeucht and G. McNulty. Avoidable patterns in strings of symbols. Pacific J. Math.85 (1979) 261–294.  Zbl0428.05001
  2. J. Berstel, J. Karhumäki. Combinatorics on Words — A Tutorial. TUCS Technical Report (No. 530, June) (2003).  Zbl1169.68560
  3. 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.  Zbl0141.01801
  4. M. Crochemore and W. Rytter. Squares, cubes, and time-space efficient string searchinng. Algorithmica13 (1995) 405–425.  Zbl0849.68044
  5. N.J. Fine, H.S. Wilf. (1965) Uniqueness theorem for periodic functions. Proc. Amer. Math. Soc.16 (1965) 109–114.  Zbl0131.30203
  6. D. Gusfield. Algorithms on Strings, Trees, and Sequences. Cambridge University Press (1997).  Zbl0934.68103
  7. N. Jacobson. Structure of Rings. American Mathematical Society, Providence, RI (1964).  
  8. M. Lothaire. Combinatorics on Words. Encyclopedia of Mathematics and its Applications, Vol. 17. Addison-Wesley, Reading, Massachusetts (1983).  Zbl0514.20045
  9. M. Lothaire. Algebraic Combinatorics on Words. Encyclopedia of Mathematics and its Applications, Vol. 90. Cambridge University Press, Cambridge (2002).  Zbl1001.68093
  10. Aldo de Luca, Stefano Varricchio. Finiteness and Regularity in Semigroups and Formal Languages. Springer-Verlag, Berlin, Heidelberg (1999).  Zbl0935.68056
  11. R.A. Rueppel. Analysis and Design of Stream Ciphers. Springer-Verlag, Berlin (1986).  
  12. I. Simon. Infinite words and a theorem of Hindman. Rev. Math. Appl.9 (1988) 97–104.  Zbl0711.05013
  13. J.A. Storer. Data compression: methods and theory. Computer Science Press, Rockville, MD (1988).  
  14. A.I. Zimin. Blocking sets of terms. Matem. sb., 119, 363–375 (Russian) (1982).  

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.