Infinite-vertex free profinite semigroupoids and symbolic dynamics
作者： Jorge Almeida , Alfredo Costa
DOI: 10.1016/J.JPAA.2008.08.009
关键词: Discrete mathematics 、 Symbolic dynamics 、 Vertex (graph theory) 、 Graph 、 Mathematics 、 Algebra and Number Theory
摘要: Abstract Some fundamental questions about infinite-vertex (free) profinite semigroupoids are clarified, putting in evidence differences with the finite-vertex case. This is done examples of free generated by graph a subshift. It also proved that for minimal subshifts, infinite edges such form connected compact groupoid.
unirioja.es
elsevier.com
up.pt 
core.ac.uk 
sci-hub.se 参考文章(39)
Jorge Almeida, SYMBOLIC DYNAMICS IN FREE PROFINITE SEMIGROUPS ,(2003)
Gérard Rauzy, Suites à termes dans un alphabet fini Seminaire de Théorie des Nombres de Bordeaux. ,vol. 12, pp. 1- 16 ,(1983)
Jean Berstel, Dominique Perrin, Theory of codes ,(1985)
J. Harvey Carruth, R. J. Koch, J. A. Hildebrant, The theory of topological semigroups M. Dekker. ,(1986)
Gerard Lallement, Semigroups and combinatorial applications ,(1979)
Jorge Almeida, Profinite semigroups and applications Springer, Dordrecht. pp. 1- 45 ,(2005) , 10.1007/1-4020-3817-8_1
J. E. Pin, Varieties of Formal Languages Springer US. ,(1986) , 10.1007/978-1-4613-2215-3
Douglas A. Lind, Brian Marcus, An Introduction to Symbolic Dynamics and Coding ,(2010)
M. Lothaire, Algebraic Combinatorics on Words ,(2002)
Kenneth Ireland, Michael Rosen, A classical introduction to modern number theory GTM. ,vol. 84, ,(1982) , 10.1007/978-1-4757-1779-2