On the exponent of periodicity of minimal solutions of context equations

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

Volumn 1379, Issue , 1998, Pages 61-75

  Schmidt Sehauß, Manfred ^a   Schulz, Klaus U ^b  

^a GOETHE UNIVERSITY   (Germany)

^b UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CONTEXT EQUATIONS; CONTEXT UNIFICATIONS; GENERALISATION; MINIMAL SOLUTIONS;

COMPUTABILITY AND DECIDABILITY;

EID: 84958752368     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0052361     Document Type: Conference Paper

References (16)

1. F. Baader and K. U. Schulz. Unification in the union of disjoint equational theories: Combining decision procedures. J. Symbolic Computation, 21:211-243, 1996.
2. V. Bulitko. Equations and inequalities in a free group and free semigroup. Tul. Gos. Ped. Inst. Učen. Zap. Mat. Kafedr. Vyp 2 Geometr. i Algebra, pages 242-252, 1970. in Russian.
3. H. Comon. Completion of rewrite systems with membership constraints, part I: Deduction rules and part II: Constraint solving. Technical report, CNRS and LRI, Université de Paris Sud, 1993. to appear in JSC.
4. W. Farmer. A unification algorithm for second order monadic terms. Annals of Pure and Applied Logic, 39:131-174, 1988.
5. W. Farmer. Simple second-order languages for which unification is undecidable. Theoretical Computer Science, 87:173-214, 1991.
6. M. Garey and D. Johnson. "Computers and Intractability": A guide to the theory of NP-completeness. W.H. Freeman and Co., San Francisco, 1979.
7. W. Goldfarb. The undecidability of the second-order unification problem. Theoretical Computer Science, 13:225-230, 1981.
8. G. Huet. A unification algorithm for typed,λ-calculus. Theoretical Computer Science, 1:27-57, 1975.
9. A. Kościelki and L. Pacholski. Complexity of Makanin's algorithms. Journal of the Association for Computing Machinery, 43:670-684, 1996.
10. J. Levy. Linear second order unification. In Proc. of the 7th Int. Conf. on Rewriting Techniques and Applications, volume 1103 of LNCS, pages 332-346, 1996.
11. G. Makanin. The problem of solvability of equations in a free semigroup. Math. USSR Sbornik, 32(2):129-198, 1977.
12. J. Niehren, M. Pinkal, and P. Ruhrberg. On equality up-to constraints over finite trees, context unification, and one-step rewriting. In Proc. of the Int. Conf. on Automated Deduction, volume 1249 of LNCS, pages 34-48, 1997.
13. T. Pietrzykowski. A complete mechanization of second-order type theory. J. A CM, 20:333-364, 1973.
14. M. Schmidt-Schanß. Unification of stratified second-order terms. Internal Report. 12/94, Fachbereich Informatik, Universitäit Frankfurt, Germany, 1994.
15. M. Schmidt-Schauß. An algorithm fox" distributive unification. In Proc. of the 7th Int. Conf. on Rewriting Techniques and Applications, volume 1103 of LNCS, pages 287-301, 1996.
16. W. Snyder and J. Gallier. Higher-order unification revisited: Complete sets of transformations. J. Symbolic Computation, 8:101-140, 1989.