Pages that link to "Item:Q1763707"
From MaRDI portal
The following pages link to Decision problems for semi-Thue systems with a few rules (Q1763707):
Displaying 35 items.
- On termination of confluent one-rule string-rewriting systems (Q286976) (← links)
- New proof for the undecidability of the circular PCP (Q378203) (← links)
- On the \(n\)-permutation Post correspondence problem (Q496055) (← links)
- Rectangular tileability and complementary tileability are undecidable (Q740261) (← links)
- Integer weighted automata on infinite words (Q832935) (← links)
- The decision problem for some logics for finite words on infinite alphabets (Q843605) (← links)
- Termination of \(\{aa\rightarrow bc,bb\rightarrow ac,cc\rightarrow ab\}\) (Q844184) (← links)
- Reachability problems in quaternion matrix and rotation semigroups (Q958311) (← links)
- Modelization of deterministic rational relations (Q1603699) (← links)
- Relative undecidability in term rewriting. II: The confluence hierarchy (Q1854560) (← links)
- Reachability problems in low-dimensional nondeterministic polynomial maps over integers (Q2051802) (← links)
- A Lyndon's identity theorem for one-relator monoids (Q2135760) (← links)
- Word problem for deterministic and reversible semi-Thue systems (Q2247995) (← links)
- On the size of computationally complete hybrid networks of evolutionary processors (Q2271455) (← links)
- Extension of the decidability of the marked PCP to instances with unique blocks (Q2373757) (← links)
- On undecidability bounds for matrix decision problems (Q2474220) (← links)
- Improved matrix pair undecidability results (Q2641877) (← links)
- Undecidable Properties on Length-Two String Rewriting Systems (Q2873677) (← links)
- On the decidability of semigroup freeness (Q2905326) (← links)
- Undecidability of infinite post correspondence problem for instances of size 8 (Q2905329) (← links)
- UNDECIDABILITY BOUNDS FOR INTEGER MATRICES USING CLAUS INSTANCES (Q3065609) (← links)
- ON THE UNDECIDABILITY OF THE IDENTITY CORRESPONDENCE PROBLEM AND ITS APPLICATIONS FOR WORD AND MATRIX SEMIGROUPS (Q3069735) (← links)
- REDUCTION TREE OF THE BINARY GENERALIZED POST CORRESPONDENCE PROBLEM (Q3086251) (← 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)
- Tiling the Plane with a Fixed Number of Polyominoes (Q3618618) (← links)
- Post Correspondence Problem and Small Dimensional Matrices (Q3637212) (← links)
- LARGE SIMPLE BINARY EQUALITY WORDS (Q4923286) (← links)
- Questions in algebra and mathematical logic. Scientific heritage of S. I. Adian (Q4992044) (← links)
- Automatic sequences of rank two (Q5044415) (← links)
- On the termination problem for one-rule semi-Thue system (Q5055868) (← links)
- (Q5089200) (← links)
- Average-Case Completeness in Tag Systems (Q5090467) (← links)
- Integer Weighted Automata on Infinite Words (Q6169963) (← links)
- Synchronizing deterministic push-down automata can be really hard (Q6186317) (← links)
