On some properties of very pure codes

DOI10.1016/0304-3975(80)90012-2zbMath0421.68078OpenAlexW1979386535MaRDI QIDQ1133332

Antonio Restivo, Aldo De Luca

Publication date: 1980

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(80)90012-2

zbMATH Keywords

maximalitydensitysynchronizationvery pure codes

Mathematics Subject Classification ID

Artificial intelligence (68T99) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (9)

Finitary codes for biinfinite words ⋮ Unnamed Item ⋮ Maximal circular codesversusmaximal codes ⋮ A synchronization property of pure subsemigroups of a free semigroup ⋮ Completing circular codes in regular submonoids ⋮ Codes and maximal monoids ⋮ Pseudo-cyclic renewal systems ⋮ On maximal codes with bounded synchronization delay ⋮ On maximal codes with a finite interpreting delay.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A combinatorial property of codes having finite synchronization delay
• Fast Pattern Matching in Strings
• On a question of McNaughton and Papert
• On synchronizing prefix codes
• Codes with bounded synchronization delay
• On a Factorisation of Free Monoids

This page was built for publication: On some properties of very pure codes