Finite Completion of comma-free codes Part 2
From MaRDI portal
Finite Completion of comma-free codes Part 2
Recommendations
Cites work
- scientific article; zbMATH DE number 3943051 (Why is no real title available?)
- scientific article; zbMATH DE number 50943 (Why is no real title available?)
- scientific article; zbMATH DE number 1948513 (Why is no real title available?)
- scientific article; zbMATH DE number 3247161 (Why is no real title available?)
- Automata accepting primitive words
- Comma-Free Codes
- On codes having no finite completions
- Outfix and infix codes and related classes of languages
- Regent Results in Comma-Free Codes
- The equation \(a_ M=b^ Nc^ P\) in a free group
- Uniqueness Theorems for Periodic Functions
Cited in
(10)- Completing comma-free codes
- Some properties of maximal comma-free codes
- Embedding a \(\theta \)-invariant code into a complete one
- scientific article; zbMATH DE number 3891253 (Why is no real title available?)
- A note on codes having no finite completions
- Two-dimensional comma-free and cylindric codes
- Completing solid codes to maximal comma-free codes
- scientific article; zbMATH DE number 7731171 (Why is no real title available?)
- scientific article; zbMATH DE number 2114221 (Why is no real title available?)
- Finite Completion of comma-free codes Part 1
This page was built for publication: Finite Completion of comma-free codes Part 2
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4825391)
