The power of commuting with finite sets of words

DOI10.1007/s00224-006-1321-zzbMath1121.68065OpenAlexW2002328599MaRDI QIDQ2643146

Michal Kunc

Publication date: 23 August 2007

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-006-1321-z

zbMATH Keywords

Conway's conjecture

Mathematics Subject Classification ID

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

Related Items (23)

Conjugacy relations of prefix codes ⋮ Equations over sets of integers with addition only ⋮ Playing with Conway's problem ⋮ Weighted Automata on Infinite Words in the Context of Attacker-Defender Games ⋮ On the expressive power of univariate equations over sets of natural numbers ⋮ Complexity of equations over sets of natural numbers ⋮ Unique decipherability in the monoid of languages: an application of rational relations ⋮ On effective construction of the greatest solution of language inequality \(XA\subseteq BX\) ⋮ Computational power of two stacks with restricted communication ⋮ Unnamed Item ⋮ Length Codes, Products of Languages and Primality ⋮ Computational completeness of equations over sets of natural numbers ⋮ Representing hyper-arithmetical sets by equations over sets of integers ⋮ Weighted automata on infinite words in the context of attacker-defender games ⋮ Simple equations on binary factorial languages ⋮ Unique decipherability in the additive monoid of sets of numbers ⋮ ON EQUATIONS OVER SETS OF NUMBERS AND THEIR LIMITATIONS ⋮ Conjugacy of finite biprefix codes ⋮ On Equations over Sets of Numbers and Their Limitations ⋮ Unique Decipherability in the Monoid of Languages: An Application of Rational Relations ⋮ Language equations with complementation: expressive power ⋮ Language equations ⋮ Variants of codes and indecomposable languages

This page was built for publication: The power of commuting with finite sets of words