Pages that link to "Item:Q4179180"
From MaRDI portal
The following pages link to THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUP (Q4179180):
Displayed 50 items.
- Generating languages by a derivation procedure for elementary formal systems (Q294648) (← links)
- Simple linear string constraints (Q469349) (← links)
- Z3str2: an efficient solver for strings, regular expressions, and length constraints (Q526767) (← links)
- Solvability of word equations modulo finite special and confluent string-rewriting systems is undecidable in general (Q673984) (← links)
- Equations over finite sets of words and equivalence problems in automata theory (Q685449) (← links)
- Complexity of unification problems with associative-commutative operators (Q688565) (← links)
- Regular expression order-sorted unification and matching (Q741252) (← links)
- The Ehrenfeucht conjecture: A compactness claim for finitely generated free monoids (Q798007) (← links)
- Simple second-order languages for which unification is undecidable (Q807609) (← links)
- On equations in free semigroups with certain constraints on their solutions. (Q843606) (← links)
- Simplifying the signature in second-order unification (Q843951) (← links)
- New techniques for proving the decidability of equivalence problem (Q913523) (← links)
- Anti-patterns for rule-based languages (Q968527) (← links)
- On the relation between context and sequence unification (Q1034550) (← links)
- Context unification with one context variable (Q1041589) (← links)
- A view of computability on term algebras (Q1051428) (← links)
- A unification algorithm for second-order monadic terms (Q1109019) (← links)
- Makanin's algorithm is not primitive recursive (Q1127320) (← links)
- Equational unification, word unification, and 2nd-order equational unification (Q1129255) (← links)
- Completion for unification (Q1178701) (← links)
- A decision algorithm for distributive unification (Q1275018) (← links)
- Word unification and transformation of generalized equations (Q1319389) (← links)
- Solvability of context equations with two context variables is decidable (Q1599536) (← links)
- \(\forall \exists^{5}\)-equational theory of context unification is undecidable (Q1607219) (← links)
- The complexity of verbal languages over groups (Q1713480) (← links)
- On the undecidability of second-order unification (Q1854349) (← links)
- Decidability of bounded second order unification (Q1887168) (← links)
- Undecidability of the positive \(\forall\exists^ 3\)-theory of a free semigroup (Q1921846) (← links)
- On equations and first-order theory of one-relator monoids (Q2051781) (← links)
- Profinite topologies (Q2074218) (← links)
- Symbolic computation in Maude: some tapas (Q2119100) (← links)
- String theories involving regular membership predicates: from practice to theory and back (Q2140459) (← links)
- On ``simple'' undecidable fragments of the positive theory of a free semigroup (Q2211367) (← links)
- First-order concatenation theory with bounded quantifiers (Q2219089) (← links)
- A.D. Taimanov and model theory in Kazakhstan (Q2306026) (← links)
- On PSPACE generation of a solution set of a word equation and its applications (Q2326385) (← links)
- Decidability of bounded higher-order unification (Q2456577) (← links)
- Solving equations with sequence variables and sequence functions (Q2457427) (← links)
- The non-parametrizability of the word equation \(xyz=zvx\): a short proof (Q2575750) (← links)
- A theorem on generalizations of proofs (Q2640597) (← links)
- Towards more efficient methods for solving regular-expression heavy string constraints (Q2680985) (← links)
- Two-variable word equations (Q2729626) (← links)
- Pattern Unification with Sequence Variables and Flexible Arity Symbols (Q2842594) (← links)
- On Conjugacy of Languages (Q3147021) (← links)
- Equations in the Partial Semigroup of Words with Overlapping Products (Q3166946) (← links)
- Chain-Free String Constraints (Q3297597) (← links)
- SOLVING DIFFERENCE EQUATIONS IN SEQUENCES: UNIVERSALITY AND UNDECIDABILITY (Q3304645) (← links)
- What Is Essential Unification? (Q3305325) (← links)
- Theories of orders on the set of words (Q3374756) (← links)
- Elementariness of a finite set of words is co-NP-complete (Q3484360) (← links)