The following pages link to (Q3901701):
Displaying 19 items.
- Closure properties of pattern languages (Q340552) (← links)
- Periodicity forcing words (Q496053) (← links)
- Systems of equations over a free monoid and Ehrenfeucht's conjecture (Q786545) (← links)
- The Ehrenfeucht conjecture: A compactness claim for finitely generated free monoids (Q798007) (← links)
- On binary equality sets and a solution to the test set conjecture in the binary case (Q1056551) (← links)
- Inverse morphic equivalence on languages (Q1061490) (← links)
- Test sets for morphisms with bounded delay (Q1067414) (← links)
- Representations of language families by homomorphic equality operations and generalized equality sets (Q1099633) (← links)
- The (generalized) Post correspondence problem with lists consisting of two words is decidable (Q1168746) (← links)
- Deciding whether a finite set of words has rank at most two (Q1210296) (← links)
- Fixed point languages of rational transductions (Q1822509) (← links)
- Binary equality sets are generated by two words (Q1867297) (← links)
- Formalizing a fragment of combinatorics on words (Q2011632) (← links)
- Unambiguous injective morphisms in free groups (Q2105430) (← links)
- Equation $$x^iy^jx^k=u^iv^ju^k$$ in Words (Q2799193) (← links)
- Ambiguity of Morphisms in a Free Group (Q3449361) (← links)
- Large Simple Binary Equality Words (Q3533027) (← links)
- Post correspondence problem: Words possible as primitive solutions (Q4645167) (← links)
- Binary equality words with two $b$'s (Q4683346) (← links)
