Equations over the \(k\)-binomial monoids

DOI10.1007/978-3-030-85088-3_16zbMath1497.68407OpenAlexW3196340331MaRDI QIDQ2140471

Markus A. Whiteland

Publication date: 20 May 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-85088-3_16

zbMATH Keywords

conjugacycompactnesscommutativitycommutationcompact monoid\(k\)-binomial equivalence

Mathematics Subject Classification ID

Combinatorics on words (68R15) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (2)

Binomial complexities and Parikh-collinear morphisms ⋮ Characterizations of families of morphisms and words via binomial complexities

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Another generalization of abelian equivalence: binomial complexity of infinite words
• Elements of algebraic geometry over a free semilattice
• A proof of Ehrenfeucht's conjecture
• On the size of independent systems of equations in semigroups
• The satisfiability of word equations: decidable and undecidable theories
• A compactness property of the \(k\)-abelian monoids
• Avoiding 2-binomial squares and cubes
• Compactness of Systems of Equations in Semigroups
• One-Variable Word Equations and Three-Variable Constant-Free Word Equations
• The binomial equivalence classes of finite words
• An Optimal Bound on the Solution Sets of One-Variable Word Equations and its Consequences
• Templates for the \(k\)-binomial complexity of the Tribonacci word
• Quadratic word equations with length constraints, counter systems, and Presburger arithmetic with divisibility

This page was built for publication: Equations over the \(k\)-binomial monoids