On some properties of very pure codes

DOI10.1016/0304-3975(80)90012-2MaRDI QIDQ1133332zbMATHOpenAlexFDO

Authors 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

densitysynchronizationmaximalityvery pure codes

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• scientific article; zbMATH DE number 3238653 (Why is no real title available?)
• scientific article; zbMATH DE number 3397707 (Why is no real title available?)
• A combinatorial property of codes having finite synchronization delay
• Codes with bounded synchronization delay
• Fast Pattern Matching in Strings
• On a Factorisation of Free Monoids
• On a question of McNaughton and Papert
• On synchronizing prefix codes

Cited in

(10)

• On maximal codes with a finite interpreting delay.
• On maximal codes with bounded synchronization delay
• Codes and maximal monoids
• A synchronization property of pure subsemigroups of a free semigroup
• Pseudo-cyclic renewal systems
• Maximal circular codesversusmaximal codes
• scientific article; zbMATH DE number 3682031 (Why is no real title available?)
• Completing circular codes in regular submonoids
• Finitary codes for biinfinite words
• Unambiguously coded shifts

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1133332)