Pages that link to "Item:Q4919632"

The following pages link to Recursive Unsolvability of a problem of Thue (Q4919632):

Displayed 50 items.

• On regularity of context-free languages (Q759489) ‎ (← links)
• Conjugacy in monoids with a special Church-Rosser presentation is decidable (Q801163) ‎ (← links)
• A new lower bound construction for commutative Thue systems with applications (Q808265) ‎ (← links)
• The origins of combinatorics on words (Q872058) ‎ (← links)
• Word problems over traces which are solvable in linear time (Q914395) ‎ (← links)
• The complexity of small universal Turing machines: A survey (Q1004087) ‎ (← links)
• Unsolvability of the universal theory of finite groups (Q1054715) ‎ (← links)
• Model-theoretic and algorithmic questions in group theory (Q1063112) ‎ (← links)
• Unsolvability of problems of equality and divisibility in certain varieties of semigroups (Q1065939) ‎ (← links)
• Complexity results on the conjugacy problem for monoids (Q1073015) ‎ (← links)
• Complexity of certain decision problems about congruential languages (Q1085618) ‎ (← links)
• The word and generator problems for lattices (Q1105626) ‎ (← links)
• Unsolvable algorithmic problems for semigroups, groups and rings (Q1117039) ‎ (← links)
• Recursive undecidability of the binding property for finitely presented equational classes (Q1151417) ‎ (← links)
• Sur la liaison entre problèmes combinatoires et algorithmiques (Q1156785) ‎ (← links)
• Symmetric space-bounded computation (Q1167537) ‎ (← links)
• Decision problems for propositional linear logic (Q1192352) ‎ (← links)
• A field guide to equational logic (Q1201350) ‎ (← links)
• Historical evolution of the concept of homotopic paths (Q1205992) ‎ (← links)
• Well rewrite orderings and well quasi-orderings (Q1209622) ‎ (← links)
• Distributive lattices of subspaces and the equality problem for algebras with a single relation (Q1244344) ‎ (← links)
• On termination of one rule rewrite systems (Q1334676) ‎ (← links)
• Formal model of internal measurement: Alternate changing between recursive definition and domain equation (Q1373932) ‎ (← links)
• The undecidability of the unrestricted modified edit distance (Q1390869) ‎ (← links)
• The word problem for \(1\mathcal{LC}\) congruences is NP-hard. (Q1426452) ‎ (← links)
• Composition-diamond lemma for associative conformal algebras. (Q1427371) ‎ (← links)
• Frontier between decidability and undecidability: A survey (Q1575913) ‎ (← links)
• Undecidability of existential properties in picture languages (Q1575948) ‎ (← links)
• Decision problems for semi-Thue systems with a few rules (Q1763707) ‎ (← links)
• The complexity of the word problems for commutative semigroups and polynomial ideals (Q1836661) ‎ (← links)
• Undecidable questions related to Church-Rosser Thue systems (Q1839249) ‎ (← links)
• Many-one degrees associated with semi-Thue systems (Q1844662) ‎ (← links)
• Thue trees (Q1861534) ‎ (← links)
• Left-divisibility and word problems in single relation monoids (Q1924517) ‎ (← links)
• Generalized sums over histories for quantum gravity. II: Simplicial conifolds (Q1966070) ‎ (← links)
• Inverse monoids: decidability and complexity of algebraic questions. (Q2643082) ‎ (← links)
• Closing the Circle: An Analysis of Emil Post's Early Work (Q3430940) ‎ (← links)
• Generic complexity of undecidable problems (Q3503760) ‎ (← links)
• Efficient Computation in Groups and Simplicial Complexes (Q3669634) ‎ (← links)
• The word problem for cancellation semigroups with zero (Q3712329) ‎ (← links)
• Alfred Tarski and undecidable theories (Q3764095) ‎ (← links)
• Church-Rosser systems with respect to formal languages (Q3796797) ‎ (← links)
• (Q3885224) ‎ (← links)
• The word problem and the isomorphism problem for groups (Q3941599) ‎ (← links)
• The theory of recursive functions, approaching its centennial (Q3946156) ‎ (← links)
• Undecidability of the identity problem for finite semigroups (Q4008756) ‎ (← links)
• Word problems (Q4170710) ‎ (← links)
• UNDECIDABILITY, AUTOMATA, AND PSEUDOVARITIES OF FINITE SEMIGROUPS (Q4513305) ‎ (← links)
• Regular canonical systems (Q5338328) ‎ (← links)
• DECIDABILITY AND COMPLEXITY IN AUTOMATIC MONOIDS (Q5462671) ‎ (← links)