Conjugacy relations of prefix codes
From MaRDI portal
Publication:287447
DOI10.1016/j.tcs.2016.05.021zbMath1339.68172OpenAlexW2404734631MaRDI QIDQ287447
Zihan Yuan, Yong He, Zhenhe Cui
Publication date: 26 May 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.05.021
Algebraic theory of languages and automata (68Q70) Prefix, length-variable, comma-free codes (94A45)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Knuth-Bendix algorithm and the conjugacy problem in monoids.
- Conjugacy of finite biprefix codes
- Commutation with codes
- The power of commuting with finite sets of words
- Codes et motifs
- CONJUGACY IN FREE INVERSE MONOIDS
- On Conjugacy of Languages
- Towards Decidability of Conjugacy of Pairs and Triples
- Codes conjugués
- LINEAR-TIME PRIME DECOMPOSITION OF REGULAR PREFIX CODES