Synchronization and simplification

DOI10.1016/0012-365X(79)90164-XzbMath0417.68059OpenAlexW2162780008MaRDI QIDQ755320

Antonio Restivo, Dominique Perrin, Aldo De Luca, Settimo Termini

Publication date: 1979

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(79)90164-x

zbMATH Keywords

synchronizationfree semigroupdeciphering delaysimplificationtheory of codessyntactic semigroupfinite maximal code

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (8)

Representation of (Left) Ideal Regular Languages by Synchronizing Automata ⋮ The meet operation in the lattice of codes ⋮ Unnamed Item ⋮ Semisimplicity of the algebra associated to a biprefix code ⋮ A synchronization property of pure subsemigroups of a free semigroup ⋮ Codes, simplifying words, and open set condition ⋮ Sur la classification syntaxique ⋮ On three-element codes

Cites Work

• Codes asynchrones
• Maximal Prefix-Synchronized Codes
• On a question of McNaughton and Papert
• Sur certains sous-monoïdes libres
• On a question concerning certain free submonoids
• Codes with bounded synchronization delay
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Synchronization and simplification