Pages that link to "Item:Q1605309"
From MaRDI portal
The following pages link to Binary (generalized) Post Correspondence Problem (Q1605309):
Displaying 16 items.
- New proof for the undecidability of the circular PCP (Q378203) (← links)
- Post correspondence problem for short words (Q975420) (← links)
- Decidability of the binary infinite Post Correspondence Problem (Q1408462) (← 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)
- (Q3778004) (← links)
- Remarks on generalized Post Correspondence Problem (Q4593916) (← links)
- Binary equality words with two $b$'s (Q4683346) (← 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)
- Decision problems on copying and shuffling (Q6614538) (← links)