Completing codes in a sofic shift
type: Item
instance of: scholarly article
title: Completing codes in a sofic shift
zbMATH Open document ID: 1194.68130
author: Marie-Pierre Béal
author: Dominique Perrin
published in: Theoretical Computer Science
publication date: 2009-10-09T00:00:00Z
full work available at URL: hal.pdf
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 5612530
zbMATH Keywords: automata and formal languages
zbMATH Keywords: codes
zbMATH Keywords: complete codes
zbMATH Keywords: sofic shifts
zbMATH Keywords: symbolic dynamics
zbMATH Keywords: variable length codes
MaRDI profile type: Publication
OpenAlex ID: W2114499665
cites work: Ensembles libres de chemins dans un graphe
cites work: Codes and local constraints
cites work: Surjective Extensions of Sliding-Block Codes
cites work: Q4430300
cites work: Complete Codes in a Sofic Shift
cites work: Codes and sofic constraints
cites work: Codes, unambiguous automata and sofic systems.
cites work: Each regular code is included in a maximal regular code
cites work: Lattice invariants for sofic shifts
cites work: An invariant for bounded-to-one factor maps between transitive sofic subshifts
cites work: An Introduction to Symbolic Dynamics and Coding
cites work: Q4529547
cites work: Symbolic dynamics. One-sided, two-sided and countable state Markov shifts
cites work: Q3673137
cites work: Q3651209
cites work: Rational probability measures
DOI: 10.1016/J.TCS.2009.07.023
Recommended article: Complete Codes in a Sofic Shift
Recommended article: Codes and sofic constraints
Recommended article: Q3820022
Recommended article: Completion of recognizable bifix codes
Recommended article: Completing solid codes to maximal comma-free codes
Recommended article: FINITE COMPLETIONS VIA FACTORIZING CODES
Recommended article: Q4953366
Recommended article: Q3033349
Recommended article: An algorithm for sofic shift equivalence
Recommended article: On codes having no finite completion
description: scientific article; zbMATH DE number 5612530