Binary equality words with two $b$'s
From MaRDI portal
Publication:4683346
DOI10.14712/1213-7243.2015.247zbMath1463.68044OpenAlexW2884846282MaRDI QIDQ4683346
Publication date: 20 September 2018
Published in: Commentationes Mathematicae Universitatis Carolinae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.14712/1213-7243.2015.247
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Periodicity forcing words
- The equation \(a_ M=b^ Nc^ P\) in a free group
- On binary equality sets and a solution to the test set conjecture in the binary case
- Sur la combinatoire des codes à deux mots. (On the combinatorics of two-word codes)
- The (generalized) Post correspondence problem with lists consisting of two words is decidable
- Binary (generalized) Post Correspondence Problem
- Binary equality sets are generated by two words
- Equation $$x^iy^jx^k=u^iv^ju^k$$ in Words
- ON THE DUAL POST CORRESPONDENCE PROBLEM
- A variant of a recursively unsolvable problem
This page was built for publication: Binary equality words with two $b$'s
