Codes and sofic constraints
From MaRDI portal
Publication:2484447
DOI10.1016/J.TCS.2005.03.033zbMATH Open1078.68074OpenAlexW2023840557MaRDI QIDQ2484447FDOQ2484447
Authors: Marie-Pierre Béal, Dominique Perrin
Publication date: 1 August 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2005.03.033
Recommendations
- Publication:3033349
- Codes and local constraints
- Completing codes in a sofic shift
- Codes et formes paramodulaires
- Codes, unambiguous automata and sofic systems.
- Complete Codes in a Sofic Shift
- Constrained Codes as Networks of Relations
- Solid codes and disjunctive domains
- Coding and definability in computable structures
- Codes and invariant theory
Cites Work
Cited In (10)
- Constrained Codes as Networks of Relations
- Codes and maximal monoids
- Codes and local constraints
- Pseudo-cyclic renewal systems
- Complete Codes in a Sofic Shift
- Completing codes in a sofic shift
- Bifix codes and Sturmian words
- Codes, unambiguous automata and sofic systems.
- Codes engendrant certains systèmes sofiques. (Codes generating certain sofic systems)
- Title not available (Why is that?)
This page was built for publication: Codes and sofic constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2484447)