Abstract
We define a new invariant for the conjugacy of irreducible sofic shifts. This invariant, that we call the syntactic graph of a sofic shift, is the directed acyclic graph of characteristic groups of the non null regular \(\mathcal{D}\)-classes of the syntactic semigroup of the shift.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Béal, M.-P.: Codage Symbolique, Masson (1993)
Béal, M.-P.: Puissance extérieure d’un automate déterministe, application au calcul de la fonction zêta d’un système sofique. RAIRO Inform. Théor. Appl. 29, 85–103 (1995)
Béal, M.-P., Fiorenzi, F., Mignosi, F.: Minimal forbidden patterns of multidimensional shifts. To appear in Internat. J. Algebra Comput. (2003)
Beauquier, D.: Minimal automaton for a factorial transitive rational language. Theoret. Comput. Sci. 67, 65–73 (1989)
Berstel, J., Perrin, D.: Theory of Codes. Academic Press, New York (1985)
Boyle, M.: Algebraic aspects of symbolic dynamics. In: Graph Reduction 1986. London Math. Soc. Lecture Notes Ser, vol. 279, pp. 57–88. Cambridge University Press, Cambridge (2000)
Hedlund, G.A.: Endomorphisms and automorphisms of the shift dynamical system. Math. Systems Theory 3, 320–337 (1969)
Jonoska, N.: A conjugacy invariant for reducible sofic shifts and its semigroup characterizations. Israel J. Math. 106, 221–249 (1998)
Kitchens, B.P.: Symbolic Dynamics: one-sided, two-sided and countable state Markov shifts. Springer, Heidelberg (1997)
Krieger, W.: On sofic systems. I. Israel J. Math. 48, 305–330 (1984)
Krieger, W.: On sofic systems. II. Israel J. Math. 60, 167–176 (1987)
Krieger, W.: On a syntactically defined invariant of symbolic dynamics. Ergodic Theory Dynam. Systems 20, 501–516 (2000)
Lind, D.A., Marcus, B.H.: An Introduction to Symbolic Dynamics and Coding, Cambridge (1995)
Luca, A.D., Restivo, A.: A characterization of strictly locally testable languages and its applications to subsemigroups of a free semigroup. Inform. and Control 44(80), 300–319
Nasu, M.: Topological conjugacy for sofic systems. Ergodic Theory Dynam. Systems 6, 265–280 (1986)
Pin, J.-E.: Varieties of formal languages, Foundations of Computer Science. Plenum Publishing Corp., New York (1986)
Weiss, B.: Subshifts of finite type and sofic systems. Monats. für Math. 77, 462–474 (1973)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Béal, MP., Fiorenzi, F., Perrin, D. (2004). The Syntactic Graph of a Sofic Shift. In: Diekert, V., Habib, M. (eds) STACS 2004. STACS 2004. Lecture Notes in Computer Science, vol 2996. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24749-4_25
Download citation
DOI: https://doi.org/10.1007/978-3-540-24749-4_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21236-2
Online ISBN: 978-3-540-24749-4
eBook Packages: Springer Book Archive