On a question of McNaughton and Papert
From MaRDI portal
Publication:4766057
Cited in
(28)- Unambiguously coded shifts
- The alphabetic complexity in homomorphic definitions of word, tree and picture languages
- Recognizability of morphisms
- Properties of pure codes
- Codes and local constraints
- A note on pure codes
- On primitive words with non-primitive product
- Circular codes and synchronization
- scientific article; zbMATH DE number 3576711 (Why is no real title available?)
- Code theory and fuzzy subsemigroups
- Pseudo-cyclic renewal systems
- On optimal factorization of free semigroups into free subsemigroups
- A completion algorithm for codes with bounded synchronization delay
- Cyclic renewal systems
- On some properties of very pure codes
- On the fixpoints of monogenic functions in free monoids
- A note on renewal systems
- Properties of code events and homomorphisms over regular events
- Some methods for generating infinite sequences
- Reducing the local alphabet size in tiling systems by means of 2D comma-free codes
- A combinatorial property of codes having finite synchronization delay
- scientific article; zbMATH DE number 3682031 (Why is no real title available?)
- Codes engendrant certains systèmes sofiques. (Codes generating certain sofic systems)
- On varieties of rational languages and variable-length codes
- On varieties of rational languages and variable length codes. II
- Synchronization and simplification
- Primitive sets of words
- The Karoubi envelope of the mirage of a subshift
This page was built for publication: On a question of McNaughton and Papert
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4766057)