The following pages link to (Q3741057):
Displaying 21 items.
- New proof for the undecidability of the circular PCP (Q378203) (← links)
- On the \(n\)-permutation Post correspondence problem (Q496055) (← links)
- Quasi-rocking real-time pushdown automata (Q650904) (← links)
- Equality sets of prefix morphisms and regular star languages (Q1041740) (← links)
- Decidability of the binary infinite Post Correspondence Problem (Q1408462) (← links)
- Distances between languages and reflexivity of relations (Q1608895) (← links)
- On fixed points of rational transductions (Q1637233) (← links)
- Two techniques in the area of the star problem in trace monoids (Q1884907) (← links)
- Weighted automata on infinite words in the context of attacker-defender games (Q2013554) (← links)
- Semigroups arising from asynchronous automata. (Q2016100) (← links)
- Probabilistic automata of bounded ambiguity (Q2064517) (← links)
- Word problem for deterministic and reversible semi-Thue systems (Q2247995) (← links)
- The exact complexity of the infinite Post Correspondence Problem (Q2345861) (← links)
- Extension of the decidability of the marked PCP to instances with unique blocks (Q2373757) (← links)
- Undecidability of infinite post correspondence problem for instances of size 8 (Q2905329) (← links)
- Selected Decision Problems for Square-Refinement Collage Grammars (Q3098030) (← links)
- Weighted Automata on Infinite Words in the Context of Attacker-Defender Games (Q3195698) (← links)
- Undecidability of infinite post correspondence problem for instances of Size 9 (Q3423136) (← links)
- Reachability via Cooperating Morphisms (Q4982083) (← links)
- Probabilistic Automata of Bounded Ambiguity (Q5111632) (← links)
- Post's Correspondence Problem for hyperbolic and virtually nilpotent groups (Q6188133) (← links)
