Synchronization and simplification
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3522202 (Why is no real title available?)
- scientific article; zbMATH DE number 3561239 (Why is no real title available?)
- scientific article; zbMATH DE number 3559875 (Why is no real title available?)
- scientific article; zbMATH DE number 3564364 (Why is no real title available?)
- scientific article; zbMATH DE number 3583696 (Why is no real title available?)
- scientific article; zbMATH DE number 3641729 (Why is no real title available?)
- scientific article; zbMATH DE number 3284302 (Why is no real title available?)
- scientific article; zbMATH DE number 3368555 (Why is no real title available?)
- Codes asynchrones
- Codes with bounded synchronization delay
- Maximal Prefix-Synchronized Codes
- On a question concerning certain free submonoids
- On a question of McNaughton and Papert
- Sur certains sous-monoïdes libres
Cited in
(8)- On three-element codes
- The meet operation in the lattice of codes
- Representation of (left) ideal regular languages by synchronizing automata
- A synchronization property of pure subsemigroups of a free semigroup
- Semisimplicity of the algebra associated to a biprefix code
- Sur la classification syntaxique
- scientific article; zbMATH DE number 3682031 (Why is no real title available?)
- Codes, simplifying words, and open set condition
This page was built for publication: Synchronization and simplification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q755320)