Monadic second-order unification Is NP-complete

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3091, Issue , 2004, Pages 55-69

  Levy, Jordi ^a   Schmidt Schauß, Manfred ^b   Villaret, Mateu ^c  

^a CSIC   (Spain)

^b GOETHE UNIVERSITY   (Germany)

^c IMA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

NP COMPLETE; SECOND ORDERS; SECOND-ORDER MATCHING;

POLYNOMIALS;

EID: 33749423952     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-25979-4_4     Document Type: Article

References (18)

1. [Far88] W. M. Farmer. A unification algorithm for second-order monadic terms. Annals of Pure and Applied Logic, 39:131-174, 1988.
2. [Far91] W. M. Farmer. Simple second-order languages for wich unification is undecidable. Theoretical Computer Science, 87:173-214, 1991.
3. [GJ79] M. Garey and D. Johnson. Computers and Intractability: A guide to the theory of NP-completeness. W.H. Freeman and Co., San Francisco, 1979.
4. [Gol81] W. D. Goldfarb. The undecidability of the second-order unification problem. Theoretical Computer Science, 13:225-230, 1981.
5. [Hue75] G. Huet. A unification algorithm for typed λ-calculus. Theoretical Computer Science, 1:27-57, 1975.
6. [KP96] A. Kościelski and L. Pacholski. Complexity of Makanin's algorithm. Journal of the ACM, 43(4):670-684, 1996.
7. [Lev98] J. Levy. Decidable and undecidable second-order unification problems. In Proceedings of the 9th Int. Conf. on Rewriting Techniques and Applications (RTA'98), volume 1379 of LNCS, pages 47-60, Tsukuba, Japan, 1998.
8. [LV00] J. Levy and M. Veanes. On the undecidability of second-order unification. Information and Computation, 159:125-150, 2000.
9. [LV02] J. Levy and M. Villaret. Currying second-order unification problems. In Proc. of the 13th Int. Conf. on Rewriting Techniques and Applications (RTA'02), volume 2378 of LNCS, pages 326-339, Copenhagen, Denmark, 2002.
10. [Mak77] G. S. Makanin. The problem of solvability of equations in a free semigroup. Math. USSR Sbornik, 32(2):129-198, 1977.
11. [Pla94] W. Plandowski. Testing equivalence of morphisms in context-free languages. In J. van Leeuwen, editor, Proc. of the 2nd Annual European Symposium on Algorithms (ESA'94), volume 855 of LNCS, pages 460-470, 1994.
12. [Pla95] W. Plandowski. The Complexity of the Morphism Equivalence Problem for Context-Free Languages. PhD thesis, Department of Mathematics, Informatics and Mechanics, Warsaw University, 1995.
13. [Pla99] W. Plandowski. Satisfiability of word equations with constants is in PSPACE. In Proc. of the 40th IEEE Annual Symposium on Foundations of Computer Science (FOCS'99), pages 495-500, 1999.
14. [SS01] M. Schmidt-Schauß. Stratified context unification is in PSPACE. In L. Fribourg, editor, Proc. of the 15th Int. Workshop in Computer Science Logic (CSL'01), volume 2142 of LNCS, pages 498-512, 2001.
15. [SS04] M. Schmidt-Schauß. Decidability of bounded second order unification. Information and Computation, 188(2):143-178, 2004.
16. [SSS98] M. Schmidt-Schauß and K. U. Schulz. On the exponent of periodicity of minimal solutions of context equations. In Proc. of the 9th Int. Conf. on Rewriting Techniques and Applications (RTA'98), volume 1379 of LNCS, pages 61-75, Tsukuba, Japan, 1998.
17. [Zhe79] A. P. Zhezherun. Decidability of the unification problem for second order languages with unary function symbols. Kibernetika (Kiev), 5:120-125, 1979.
18. Translated as Cybernetics 15(5):735-741, 1980.