The following pages link to Paliath Narendran (Q171405):
Displaying 50 items.
- Unification modulo homomorphic encryption (Q437037) (← links)
- (Q685432) (redirect page) (← links)
- On weakly confluent monadic string-rewriting systems (Q685433) (← links)
- Complexity of unification problems with associative-commutative operators (Q688565) (← links)
- Automating inductionless induction using test sets (Q758216) (← links)
- The undecidability of the preperfectness of Thue systems (Q797574) (← links)
- Semi-unification (Q808713) (← links)
- Algorithmic problems in the symbolic approach to the verification of automatically synthesized cryptosystems (Q831949) (← links)
- On ground-confluence of term rewriting systems (Q913496) (← links)
- Rigid E-unification: NP-completeness and applications to equational matings (Q921913) (← links)
- Closure properties and decision problems of dag automata (Q1041757) (← links)
- An \(O(| T| ^ 3)\) algorithm for testing the Church-Rosser property of Thue systems (Q1057263) (← links)
- The Church-Rosser property and special Thue systems (Q1071759) (← links)
- Complexity results on the conjugacy problem for monoids (Q1073015) (← links)
- A finite Thue system with decidable word problem and without equivalent finite canonical system (Q1073016) (← links)
- On sufficient-completeness and related properties of term rewriting systems (Q1077161) (← links)
- On recursive path ordering (Q1082075) (← links)
- Complexity of certain decision problems about congruential languages (Q1085618) (← links)
- On the regular equivalence problem for regular Thue systems (Q1087011) (← links)
- Special monoids and special Thue systems (Q1089108) (← links)
- The problems of cyclic equality and conjugacy for finite complete rewriting systems (Q1089798) (← links)
- Complexity of matching problems (Q1099615) (← links)
- Only prime superpositions need be considered in the Knuth-Bendix completion procedure (Q1106657) (← links)
- Preperfectness is undecidable for Thue systems containing only length- reducing rules and a single commutation rule (Q1107523) (← links)
- Elements of finite order for finite weight-reducing and confluent Thue systems (Q1121013) (← links)
- Some polynomial-time algorithms for finite monadic Church-Rosser Thue systems (Q1123619) (← links)
- Equational unification, word unification, and 2nd-order equational unification (Q1129255) (← links)
- It is undecidable whether a finite special string-rewriting system presents a group (Q1184861) (← links)
- Codes modulo finite monadic string-rewriting systems (Q1341747) (← links)
- Any ground associative-commutative theory has a finite canonical system (Q1357668) (← links)
- Single versus simultaneous equational unification and equational unification for variable-permuting theories (Q1367080) (← links)
- Unification modulo ACUI plus distributivity axioms (Q1774555) (← links)
- Cancellativity in finitely presented semigroups (Q1824041) (← links)
- Complexity of nilpotent unification and matching problems. (Q1854363) (← links)
- On asymmetric unification for the theory of XOR with a homomorphism (Q2180236) (← links)
- Reviving basic narrowing modulo (Q2180237) (← links)
- Asymmetric unification and disunification (Q2185487) (← links)
- Unification modulo lists with reverse relation with certain word equations (Q2305403) (← links)
- Sufficient-completeness, ground-reducibility and their complexity (Q2641108) (← links)
- (Q2767094) (← links)
- String rewriting and security analysis: an extension of a result of Book and Otto (Q2819401) (← links)
- Unification over distributive exponentiation (sub)theories (Q2819403) (← links)
- On Forward Closure and the Finite Variant Property (Q2849500) (← links)
- Unification Modulo Chaining (Q2890181) (← links)
- Unification Modulo Synchronous Distributivity (Q2908474) (← links)
- New Algorithms for Unification Modulo One-Sided Distributivity and Its Variants (Q2908511) (← links)
- On Unification Modulo One-Sided Distributivity: Algorithms, Variants and Asymmetry (Q2941759) (← links)
- Unification and Matching in Hierarchical Combinations of Syntactic Theories (Q2964469) (← links)
- Matching, unification and complexity (Q3030252) (← links)
- It is decidable whether a monadic thue system is canonical over a regular set (Q3210188) (← links)
