Surjective Extensions of Sliding-Block Codes

DOI10.1137/0406046MaRDI QIDQ4302270zbMATH OpenOpenAlexFDO

Authors Jonathan J. Ashley, Brian Marcus, Dominique Perrin, Selim Tuncel

Publication date 14 August 1994

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0406046

zbMATH Keywords

factor mapshift of finite typesliding-block code

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Ergodic theory (37A99) Graph theory (including graph drawing) in computer science (68R10) Coding theorems (Shannon theory) (94A24)

Cited in

(11)

• On maximal codes with bounded synchronization delay
• Codes and sofic constraints
• Codes, unambiguous automata and sofic systems.
• Sliding block codes between shift spaces over infinite alphabets
• Bi-resolving graph homomorphisms and extensions of bi-closing codes
• Matrices of Polynomials, Positivity, and Finite Equivalence of Markov Chains
• A completion algorithm for codes with bounded synchronization delay
• Completing Wheeler automata
• Embeddings of local automata
• Completing codes in a sofic shift
• Weak equivalence for shifts of finite type

This page was built for publication: Surjective Extensions of Sliding-Block Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4302270)