( en | de | ru )

 

Disambiguation of "Narendran, Paliath"

Author of the publication

copydeleteadd this publication to your clipboard
Codes Modulo Finite Monadic String-Rewriting Systems.

, and . Theor. Comput. Sci., 134 (1): 175-188 (1994)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Narendran, Paliath
add a person with the name Narendran, Paliath
 

Other publications of authors with the same name

Unification over Distributive Exponentiation (Sub)Theories., , , and . Journal of Automata, Languages and Combinatorics, 16 (2-4): 109-140 (2011)Matching, unification and complexity., and . SIGSAM Bull., 21 (4): 6-9 (1987)Complexity of Unification Problems with Associative-Commutative Operators., and . J. Autom. Reason., 9 (2): 261-288 (1992)Unification Modulo ACUI Plus Distributivity Axioms., , and . J. Autom. Reason., 33 (1): 1-28 (2004)Theorem Proving Using Equational Matings and Rigid E-Unification., , , and . J. ACM, 39 (2): 377-429 (1992)The Theory of Total Unary RPO Is Decidable., and . Computational Logic, volume 1861 of Lecture Notes in Computer Science, page 660-672. Springer, (2000)Semi-Unification., , , and . FSTTCS, volume 338 of Lecture Notes in Computer Science, page 435-454. Springer, (1988)Unification modulo a 2-sorted Equational theory for Cipher-Decipher Block Chaining., , , and . Log. Methods Comput. Sci., (2014)An O(|T|3) Algorithm for Testing the Church-Rosser Property of Thue Systems., , , and . Theor. Comput. Sci., (1985)Some Polynomial-Time Algorithms for Finite Monadic Church-Rosser Thue Systems., and . Theor. Comput. Sci., 68 (3): 319-332 (1989)