Pages that link to "Item:Q2955030"
From MaRDI portal
The following pages link to Undecidability in Binary Tag Systems and the Post Correspondence Problem for Five Pairs of Words (Q2955030):
Displaying 20 items.
- Parsimonious computational completeness (Q832917) (← links)
- Variations on the post correspondence problem for free groups (Q832925) (← links)
- Integer weighted automata on infinite words (Q832935) (← links)
- Weighted automata on infinite words in the context of attacker-defender games (Q2013554) (← links)
- Reachability problems in low-dimensional nondeterministic polynomial maps over integers (Q2051802) (← links)
- Polynomially ambiguous probabilistic automata on restricted languages (Q2121470) (← links)
- Undecidability of infinite Post correspondence problem for instances of size 8 (Q2905329) (← links)
- Undecidability of infinite post correspondence problem for instances of Size 9 (Q3423136) (← links)
- On the Identity Problem for the Special Linear Group and the Heisenberg Group. (Q5002819) (← links)
- (Q5089200) (← links)
- On Affine Reachability Problems (Q5089216) (← links)
- Average-Case Completeness in Tag Systems (Q5090467) (← links)
- Polynomially Ambiguous Probabilistic Automata on Restricted Languages (Q5091267) (← links)
- Binary Generalized PCP for Two Periodic Morphisms is Decidable in Polynomial Time (Q6154978) (← links)
- Integer Weighted Automata on Infinite Words (Q6169963) (← links)
- Synchronizing deterministic push-down automata can be really hard (Q6186317) (← links)
- On bi-infinite and conjugate post correspondence problems (Q6186538) (← links)
- Post's Correspondence Problem for hyperbolic and virtually nilpotent groups (Q6188133) (← links)
- On simulating Turing machines with matrix semigroups with integrality tests (Q6562876) (← links)
- Decision problems on copying and shuffling (Q6614538) (← links)
