Completions in measure of languages and related combinatorial problems

DOI10.1016/J.TCS.2004.09.009zbMath1078.68077OpenAlexW2071738369MaRDI QIDQ1763700

Arturo Carpi, Aldo De Luca

Publication date: 22 February 2005

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.09.009

zbMATH Keywords

CodesBernoulli setsBernoulli completions

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Formal languages and automata (68Q45)

Related Items (2)

Coding by minimal linear grammars ⋮ Some decompositions of Bernoulli sets and codes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A counterexample to the triangle conjecture
• Minimal complete sets of words
• On codes having no finite completions
• Some combinatorial results on Bernoulli sets and codes

This page was built for publication: Completions in measure of languages and related combinatorial problems