One-relation languages and code generators
From MaRDI portal
Publication:5021106
DOI10.1051/ITA/2021002OpenAlexW3154041927MaRDI QIDQ5021106
Publication date: 12 January 2022
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1051/ita/2021002
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Prefix-free languages as \(\omega\)-generators
- On generators of rational \(\omega\)-power languages
- Decipherability of codes
- On codes, \(\omega\)-codes and \(\omega\)-generators
- ON NON-PERIODIC SOLUTIONS OF INDEPENDENT SYSTEMS OF WORD EQUATIONS OVER THREE UNKNOWNS
- On infinitary finite length codes
- Confluence of one-rule Thue systems
This page was built for publication: One-relation languages and code generators