On some properties of very pure codes

DOI10.1016/0304-3975(80)90012-2zbMATH Open0421.68078OpenAlexW1979386535MaRDI QIDQ1133332FDOQ1133332

Aldo De Luca, Antonio Restivo

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

• Fast Pattern Matching in Strings
• On a Factorisation of Free Monoids
• On a question of McNaughton and Papert
• Codes with bounded synchronization delay
• On synchronizing prefix codes
• A combinatorial property of codes having finite synchronization delay
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (10)

• Unambiguously coded shifts
• Codes and maximal monoids
• Maximal circular codesversusmaximal codes
• Finitary codes for biinfinite words
• Pseudo-cyclic renewal systems
• On maximal codes with bounded synchronization delay
• Completing circular codes in regular submonoids
• A synchronization property of pure subsemigroups of a free semigroup
• On maximal codes with a finite interpreting delay.
• Title not available (Why is that?)

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)