\(m\)-balanced words: A generalization of balanced words

DOI10.1016/j.tcs.2003.11.021zbMath1070.68128OpenAlexW1973374963MaRDI QIDQ1884918

Naoto Miyoshi, Shinya Sano, Ryohei Kataoka

Publication date: 27 October 2004

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

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

zbMATH Keywords

Balanced wordsBilliard wordsNetwork scheduling problemsSturmian conditions

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45)

Related Items (7)

Deterministic Random Walks for Rapidly Mixing Chains ⋮ Optimal balanced control for call centers ⋮ Balance Properties and Distribution of Squares in Circular Words ⋮ BALANCE PROPERTIES AND DISTRIBUTION OF SQUARES IN CIRCULAR WORDS ⋮ Тригонометрические суммы над одномерными квазирешетками произвольной коразмерности ⋮ Do balanced words have a short period? ⋮ A Genetic Algorithm for Finding Good Balanced Sequences in a Customer Assignment Problem with no State Information

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Combinatorial properties of sequences defined by the billiard in the tesselation triangles
• Covering the positive integers by disjoint sets of the form \(\{[n\alpha+\beta: n=1,2,\dots \}\)]
• Fraenkel's conjecture for six sequences
• On low-complexity bi-infinite words and their factors
• Regular ordering and applications in control policies
• On complementary triples of Sturmian bisequences
• Multimodularity, Convexity, and Optimization Properties
• Balanced sequences and optimal routing
• Extremal Splittings of Point Processes
• Further properties of extremal sequences in queues
• Complexity of sequences defined by billiard in the cube
• Routing Jobs to Servers with Deterministic Service Times
• Episturmian words and some constructions of de Luca and Rauzy

This page was built for publication: \(m\)-balanced words: A generalization of balanced words