Previous article Next article Surjective Extensions of Sliding-Block CodesJonathan Ashley, Brian Marcus, Dominique Perrin, and Selim TuncelJonathan Ashley, Brian Marcus, Dominique Perrin, and Selim Tuncelhttps://doi.org/10.1137/0406046PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAboutAbstractSeveral constructions are presented for extending a bounded-to-one sliding-block code to a bounded-to-one surjection onto its range, while preserving nice properties of the original code.[1] R. Adler and , B. Marcus, Topological entropy and equivalence of dynamical systems, Mem. Amer. Math. Soc., 20 (1979), iv+84 83h:28027 0412.54050 ISIGoogle Scholar[2] Jonathan Ashley, An extension theorem for closing maps of shifts of finite type, Trans. Amer. Math. Soc., 336 (1993), 389–420 93e:58048 0839.54026 CrossrefISIGoogle Scholar[3] Jean Berstel and , Dominique Perrin, Theory of codes, Pure and Applied Mathematics, Vol. 117, Academic Press Inc., Orlando, FL, 1985xiv+433 87f:94033 0587.68066 Google Scholar[4] Mike Boyle, Lower entropy factors of sofic systems, Ergodic Theory Dynam. Systems, 3 (1983), 541–557 85m:54014 0529.28014 CrossrefGoogle Scholar[5] Mike Boyle, , Bruce Kitchens and , Brian Marcus, A note on minimal covers for sofic systems, Proc. Amer. Math. Soc., 95 (1985), 403–411 87d:54068 0606.28016 CrossrefISIGoogle Scholar[6] Mike Boyle, , Brian Marcus and , Paul Trow, Resolving maps and the dimension group for shifts of finite type, Mem. Amer. Math. Soc., 70 (1987), vi+146 89c:28019 0651.54018 ISIGoogle Scholar[7] V. Bruyere, , L. Wong and , L. Zhang, On completion of codes with finite deciphering delay, European J. Combin., 11 (1990), 513–521 91k:94022 0722.94006 CrossrefISIGoogle Scholar[8] E. Coven and , M. Paul, Endomorphisms of irreducible subshifts of finite type, Math. Systems Theory, 8 (1974/75), 167–175 52:4259 0309.54032 CrossrefGoogle Scholar[9] E. Coven and , M. Paul, Sofic systems, Israel J. Math., 20 (1975), 165–177 52:4260 0307.28015 CrossrefISIGoogle Scholar[10] A. Ehrenfeucht and , G. Rozenberg, Each regular code is included in a maximal regular code, RAIRO Inform. Théor. Appl., 20 (1986), 89–96 88f:68077 0609.68053 ISIGoogle Scholar[11] G. Hedlund, Endormorphisms and automorphisms of the shift dynamical system, Math. Systems Theory, 3 (1969), 320–375 41:4510 CrossrefGoogle Scholar[12] J. Hopcroft and , J. Ullman, Introduction to automata theory, languages, and computation, Addison-Wesley Publishing Co., Reading, Mass., 1979x+418 83j:68002 0426.68001 Google Scholar[13] Bruce Kitchens, , Brian Marcus and , Paul Trow, Eventual factor maps and compositions of closing maps, Ergodic Theory Dynam. Systems, 11 (1991), 85–113 92b:58062 0703.54023 CrossrefISIGoogle Scholar[14] Wolfgang Krieger, On the subsystems of topological Markov chains, Ergodic Theory Dynam. Systems, 2 (1982), 195–202 (1983) 85b:28020 0508.54032 CrossrefGoogle Scholar[15] M. Nasu, Topological conjugacy of sofic systems and extensions of automorphisms of finite subsystems of topological Markov shifts, Proc. of the Special Year in Dynamical Systems of the University of Maryland, College Park, MD, 1986–87, Springer-Verlag, Berlin, 1987 0664.28008 Google Scholar[16] M. Rabin and , D. Scott, Finite automata and their decision problems, IBM J. Res. Develop., 3 (1959), 114–125 21:2559 0158.25404 CrossrefISIGoogle Scholar[17] Antonio Restivo, Codes and local constraints, Theoret. Comput. Sci., 72 (1990), 55–64 10.1016/0304-3975(90)90046-K 92d:68079 0693.68047 CrossrefISIGoogle Scholar[18] Benjamin Weiss, Subshifts of finite type and sofic systems, Monatsh. Math., 77 (1973), 462–474 49:5308 0285.28021 CrossrefISIGoogle ScholarKeywordssliding-block codefactor mapextensionshift of finite type Previous article Next article FiguresRelatedReferencesCited byDetails Bi-resolving Graph Homomorphisms and Extensions of Bi-closing codes15 March 2013 | Acta Applicandae Mathematicae, Vol. 126, No. 1 Cross Ref Embeddings of local automataIllinois Journal of Mathematics, Vol. 54, No. 1 Cross Ref Completing codes in a sofic shiftTheoretical Computer Science, Vol. 410, No. 43 Cross Ref Embeddings of local automata Cross Ref Weak equivalence for shifts of finite typeIndagationes Mathematicae, Vol. 18, No. 4 Cross Ref Codes, unambiguous automata and sofic systemsTheoretical Computer Science, Vol. 356, No. 1-2 Cross Ref Complete Codes in a Sofic Shift Cross Ref Codes and sofic constraintsTheoretical Computer Science, Vol. 340, No. 2 Cross Ref On maximal codes with bounded synchronization delayTheoretical Computer Science, Vol. 204, No. 1-2 Cross Ref A completion algorithm for codes with bounded synchronization delay8 June 2005 Cross Ref Symbolic Dynamics and Finite Automata26 March 2013 Cross Ref Variable-length maximal codes2 June 2005 Cross Ref Canonical Encoders for Sliding Block Decoders1 August 2006 | SIAM Journal on Discrete Mathematics, Vol. 8, No. 4AbstractPDF (5328 KB)Symbolic dynamics and finite automata2 June 2005 Cross Ref Matrices of polynomials, positivity, and finite equivalence of Markov chains1 January 1993 | Journal of the American Mathematical Society, Vol. 6, No. 1 Cross Ref Volume 6, Issue 4| 1993SIAM Journal on Discrete Mathematics History Submitted:19 February 1991Accepted:12 August 1992Published online:08 August 2006 InformationCopyright © 1993 Society for Industrial and Applied MathematicsKeywordssliding-block codefactor mapextensionshift of finite typeMSC codes68R1094A2405C2058F11PDF Download Article & Publication DataArticle DOI:10.1137/0406046Article page range:pp. 582-611ISSN (print):0895-4801ISSN (online):1095-7146Publisher:Society for Industrial and Applied Mathematics