A first step in characterizing three-element codes
From MaRDI portal
Publication:1656554
DOI10.1007/S00236-017-0309-2zbMATH Open1398.68351OpenAlexW2769751368MaRDI QIDQ1656554FDOQ1656554
Authors: Cao Chunhua, Lu Qing, Yang Di
Publication date: 10 August 2018
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-017-0309-2
Recommendations
Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Combinatorics on words (68R15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Conway's problem for three-word sets.
- \(d\)-words and \(d\)-languages
- Completing codes
- A three-word code which is not prefix-suffix composed
- On three-element codes
- A property of three-element codes
- Three-element codes with one \(d\)-primitive word
- On F-semigroups with three generators
- Title not available (Why is that?)
- On the independence of equations in three variables.
Cited In (9)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A note on pure codes
- Three-element codes with one \(d\)-primitive word
- On three-element codes
- A property of three-element codes
- The second step in characterizing a three-word code
- Title not available (Why is that?)
This page was built for publication: A first step in characterizing three-element codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1656554)