The Frobenius problem for homomorphic embeddings of languages into the integers

DOI10.1016/j.tcs.2018.04.023zbMath1395.68165arXiv1712.03345OpenAlexW2962997822WikidataQ122451071 ScholiaQ122451071MaRDI QIDQ1637229

F. Michel Dekking

Publication date: 7 June 2018

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

Full work available at URL: https://arxiv.org/abs/1712.03345

zbMATH Keywords

Frobenius problemgolden mean languagepaperfolding morphismSturmian languageThue-Morse language

Mathematics Subject Classification ID

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

Related Items (4)

Synchronized sequences ⋮ The abelian complexity of infinite words and the Frobenius problem ⋮ Morphic words, Beatty sequences and integer images of the Fibonacci language ⋮ Generalized Beatty sequences and complementary triples

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Paperfolding morphisms, planefilling curves, and fractal tiles
• Substitution dynamical systems. Spectral analysis
• Automatic walks
• Computing abelian complexity of binary uniform morphic words
• Variations of the Morse-Hedlund Theorem for k-Abelian Equivalence
• Abelian complexity of minimal subshifts
• Slow Beatty Sequences, Devious Convergence, and Partitional Divergence
• On Abelian and Additive Complexity in Infinite Words

This page was built for publication: The Frobenius problem for homomorphic embeddings of languages into the integers