Conjugacy relations of prefix codes
From MaRDI portal
Publication:287447
DOI10.1016/J.TCS.2016.05.021zbMATH Open1339.68172OpenAlexW2404734631MaRDI QIDQ287447FDOQ287447
Authors: Zhenhe Cui, Zihan Yuan, Yong He
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
Recommendations
Prefix, length-variable, comma-free codes (94A45) Algebraic theory of languages and automata (68Q70)
Cites Work
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Codes conjugués
- LINEAR-TIME PRIME DECOMPOSITION OF REGULAR PREFIX CODES
- The Knuth-Bendix algorithm and the conjugacy problem in monoids.
Cited In (7)
This page was built for publication: Conjugacy relations of prefix codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q287447)