Synchronization and simplification

DOI10.1016/0012-365X(79)90164-XzbMATH Open0417.68059OpenAlexW2162780008MaRDI QIDQ755320FDOQ755320

Authors: Dominique Perrin, Antonio Restivo, 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

synchronizationtheory of codessimplificationdeciphering delayfree semigroupsyntactic semigroupfinite maximal code

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Maximal Prefix-Synchronized Codes
• Sur certains sous-monoïdes libres
• Title not available (Why is that?)
• On a question of McNaughton and Papert
• Title not available (Why is that?)
• Title not available (Why is that?)
• Codes asynchrones
• On a question concerning certain free submonoids
• Codes with bounded synchronization delay

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
• Title not available (Why is that?)
• 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)