A combinatorial property of codes having finite synchronization delay
From MaRDI portal
Cites work
- Codes with bounded synchronization delay
- Comma-Free Codes
- scientific article; zbMATH DE number 3422586 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 3559875 (Why is no real title available?)
- scientific article; zbMATH DE number 3436628 (Why is no real title available?)
- scientific article; zbMATH DE number 3284302 (Why is no real title available?)
- scientific article; zbMATH DE number 3332047 (Why is no real title available?)
- scientific article; zbMATH DE number 3350192 (Why is no real title available?)
- scientific article; zbMATH DE number 3368555 (Why is no real title available?)
- scientific article; zbMATH DE number 3397707 (Why is no real title available?)
- On a Factorisation of Free Monoids
- On a question of McNaughton and Papert
Cited in
(10)- On some properties of very pure codes
- On optimal factorization of free semigroups into free subsemigroups
- Uniformly synchronous limited codes
- On maximal codes with bounded synchronization delay
- scientific article; zbMATH DE number 3682031 (Why is no real title available?)
- On codes with finite interpreting delay: a defect theorem
- A completion algorithm for codes with bounded synchronization delay
- Homomorphisms preserving deterministic context-free languages
- Unambiguously coded shifts
- Codes and local constraints
This page was built for publication: A combinatorial property of codes having finite synchronization delay
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1247946)
