From bi-ideals to periodicity
作者： Jānis Buls , Aivars Lorencs
DOI: 10.1051/ITA:2008010
关键词: Calculus 、 Finitely-generated abelian group 、 Pure mathematics 、 Ideal (set theory) 、 Cover (algebra) 、 Mathematics 、 Word (computer architecture)
摘要: The necessary and sufficient conditions are extracted for periodicity of bi-ideals. They cover infinitely finitely generated
sci-hub.st 参考文章(16)
M. Lothaire, Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications) Cambridge University Press. ,(2005)
Juhani Karhumäki, Jean Berstel, Combinatorics on words: a tutorial. Bulletin of The European Association for Theoretical Computer Science. ,vol. 79, pp. 178- ,(2003)
Dan Gusfield, Algorithms on Strings, Trees, and Sequences: Suffix Trees and Their Uses ,(1997) , 10.1017/CBO9780511574931
M. Lothaire, Combinatorics on Words ,(1984)
James A. Storer, Data compression: methods and theory Computer Science Press, Inc.. ,(1987)
Nathan Jacobson, Structure of rings ,(1956)
Aldo de Luca, Stefano Varricchio, Finiteness and Regularity in Semigroups and Formal Languages Springer. ,(1999) , 10.1007/978-3-642-59849-4
M. Lothaire, Algebraic Combinatorics on Words ,(2002)
Rainer A. Rueppel, Analysis And Design Of Stream Ciphers ,(1986)
M. Crochemore, W. Rytter, Squares, cubes, and time-space efficient string searching Algorithmica. ,vol. 13, pp. 405- 425 ,(1995) , 10.1007/BF01190846