A conjecture on continued fractions

DOI10.1016/S0304-3975(98)00032-2zbMath0913.68158OpenAlexW1999164800WikidataQ123290349 ScholiaQ123290349MaRDI QIDQ1275461

Aldo De Luca

Publication date: 12 January 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(98)00032-2

zbMATH Keywords

continued fractionsprefix codescomplete codes

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items

Coding by minimal linear grammars ⋮ Some combinatorial results on Bernoulli sets and codes ⋮ ON A PROPERTY OF THE FACTORIZING CODES

Cites Work

• Minimal complete sets of words
• Sturmian words: structure, combinatorics, and their arithmetics
• Sturmian words, Lyndon words and trees
• On continued fractions and finite automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item