Pages that link to "Item:Q1168746"
From MaRDI portal
The following pages link to The (generalized) Post correspondence problem with lists consisting of two words is decidable (Q1168746):
Displaying 34 items.
- On some variants of Post's correspondence problem (Q792770) (← links)
- The Ehrenfeucht conjecture: A compactness claim for finitely generated free monoids (Q798007) (← links)
- Parsimonious computational completeness (Q832917) (← links)
- Variations on the post correspondence problem for free groups (Q832925) (← links)
- The origins of combinatorics on words (Q872058) (← links)
- More decidable instances of Post's correspondence problem: beyond counting (Q963345) (← links)
- Post correspondence problem for short words (Q975420) (← links)
- On binary equality sets and a solution to the test set conjecture in the binary case (Q1056551) (← links)
- Test sets for morphisms with bounded delay (Q1067414) (← links)
- Sur la combinatoire des codes à deux mots. (On the combinatorics of two-word codes) (Q1076166) (← links)
- Representations of language families by homomorphic equality operations and generalized equality sets (Q1099633) (← links)
- Flatwords and Post Correspondence Problem (Q1351939) (← links)
- Decidability of the binary infinite Post Correspondence Problem (Q1408462) (← links)
- The Post correspondence problem over a unary alphabet (Q1431872) (← links)
- Frontier between decidability and undecidability: A survey (Q1575913) (← links)
- Binary (generalized) Post Correspondence Problem (Q1605309) (← links)
- Decision problems for semi-Thue systems with a few rules (Q1763707) (← links)
- Binary equality sets are generated by two words (Q1867297) (← links)
- Extension of the decidability of the marked PCP to instances with unique blocks (Q2373757) (← links)
- GENERALIZED POST CORRESPONDENCE PROBLEM FOR MARKED MORPHISMS (Q2709980) (← links)
- On the decidability of semigroup freeness (Q2905326) (← links)
- Undecidability of infinite post correspondence problem for instances of size 8 (Q2905329) (← links)
- BINARY MORPHISMS WITH STABLE SUFFIX COMPLEXITY (Q2997928) (← links)
- REDUCTION TREE OF THE BINARY GENERALIZED POST CORRESPONDENCE PROBLEM (Q3086251) (← links)
- Undecidability of infinite post correspondence problem for instances of Size 9 (Q3423136) (← links)
- Large Simple Binary Equality Words (Q3533027) (← links)
- Post Correspondence Problem and Small Dimensional Matrices (Q3637212) (← links)
- Binary equality words with two $b$'s (Q4683346) (← links)
- LARGE SIMPLE BINARY EQUALITY WORDS (Q4923286) (← links)
- Automatic sequences of rank two (Q5044415) (← links)
- Marked PCP is decidable (Q5941069) (← links)
- Binary Generalized PCP for Two Periodic Morphisms is Decidable in Polynomial Time (Q6154978) (← links)
- On bi-infinite and conjugate post correspondence problems (Q6186538) (← links)
- Post's Correspondence Problem for hyperbolic and virtually nilpotent groups (Q6188133) (← links)
