Binary equality sets are generated by two words

DOI10.1016/S0021-8693(02)00534-3zbMath1010.68101arXiv1209.4061OpenAlexW2031222199WikidataQ105697911 ScholiaQ105697911MaRDI QIDQ1867297

Štěpán Holub

Publication date: 2 April 2003

Published in: Journal of Algebra (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items

Equality sets of binary D0L sequences, Unavoidable regularities in long words with bounded number of symbol occurrences, Decidability of the binary infinite Post Correspondence Problem, Large Simple Binary Equality Words, BINARY MORPHISMS WITH STABLE SUFFIX COMPLEXITY, Periodicity forcing words, Explicit test sets for iterated morphisms in free monoids and metabelian groups, Formalizing a fragment of combinatorics on words, Binary equality words with two $b$'s, REDUCTION TREE OF THE BINARY GENERALIZED POST CORRESPONDENCE PROBLEM, The intersection of \(3\)-maximal submonoids, INTRICACIES OF SIMPLE WORD EQUATIONS: AN EXAMPLE

Cites Work

• On binary equality sets and a solution to the test set conjecture in the binary case
• Sur le théorème du defaut
• The (generalized) Post correspondence problem with lists consisting of two words is decidable
• GENERALIZED POST CORRESPONDENCE PROBLEM FOR MARKED MORPHISMS
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item