{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T10:43:39Z","timestamp":1749725019855},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540643012"},{"type":"electronic","value":"9783540697213"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0052361","type":"book-chapter","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T01:31:11Z","timestamp":1149643871000},"page":"61-75","source":"Crossref","is-referenced-by-count":19,"title":["On the exponent of periodicity of minimal solutions of context equations"],"prefix":"10.1007","author":[{"given":"Manfred","family":"Schmidt-Schau\u00df","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Klaus U.","family":"Schulz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,5,18]]},"reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1006\/jsco.1996.0009","volume":"21","author":"F. Baader","year":"1996","unstructured":"F. Baader and K. U. Schulz. Unification in the union of disjoint equational theories: Combining decision procedures. J. Symbolic Computation, 21:211\u2013243, 1996.","journal-title":"J. Symbolic Computation"},{"key":"6_CR2","unstructured":"V. Bulitko. Equations and inequalities in a free group and free semigroup. Tul. Gos. Ped. Inst. Ucen. Zap. Mat. Kafedr. Vyp 2 Geometr. i Algebra, pages 242\u2013252, 1970. in Russian."},{"key":"6_CR3","unstructured":"H. Comon. Completion of rewrite systems with membership constraints, part I: Deduction rules and part II: Constraint solving. Technical report, CNRS and LRI, Universit\u00e9 de Paris Sud, 1993. to appear in JSC."},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0168-0072(88)90015-2","volume":"39","author":"W. Farmer","year":"1988","unstructured":"W. Farmer. A unification algorithm for second order monadic terms. Annals of Pure and Applied Logic, 39:131\u2013174, 1988.","journal-title":"Annals of Pure and Applied Logic"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/S0304-3975(06)80003-4","volume":"87","author":"W. Farmer","year":"1991","unstructured":"W. Farmer. Simple second-order languages for which unification is undecidable. Theoretical Computer Science, 87:173\u2013214, 1991.","journal-title":"Theoretical Computer Science"},{"key":"6_CR6","volume-title":"\u201cComputers and Intractability\u201d: A guide to the theory of NP-completeness","author":"M. Garey","year":"1979","unstructured":"M. Garey and D. Johnson. \u201cComputers and Intractability\u201d: A guide to the theory of NP-completeness. W.H. Freeman and Co., San Francisco, 1979."},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0304-3975(81)90040-2","volume":"13","author":"W. Goldfarb","year":"1981","unstructured":"W. Goldfarb. The undecidability of the second-order unification problem. Theoretical Computer Science, 13:225\u2013230, 1981.","journal-title":"Theoretical Computer Science"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0304-3975(75)90011-0","volume":"1","author":"G. Huet","year":"1975","unstructured":"G. Huet. A unification algorithm for typed \u03bb-calculus. Theoretical Computer Science, 1:27\u201357, 1975.","journal-title":"Theoretical Computer Science"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"670","DOI":"10.1145\/234533.234543","volume":"43","author":"A. Koscielski","year":"1996","unstructured":"A. Koscielski and L. Pacholski. Complexity of Makanin's algorithms. Journal of the Association for Computing Machinery, 43:670\u2013684, 1996.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"6_CR10","first-page":"332","volume":"1103","author":"J. Levy","year":"1996","unstructured":"J. Levy. Linear second order unification. In Proc. of the 7th Int. Conf. on Rewriting Techniques and Applications, volume 1103 of LNCS, pages 332\u2013346, 1996.","journal-title":"LNCS"},{"issue":"2","key":"6_CR11","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1070\/SM1977v032n02ABEH002376","volume":"32","author":"G. Makanin","year":"1977","unstructured":"G. Makanin. The problem of solvability of equations in a free semigroup. Math. USSR Sbornik, 32(2): 129\u2013198, 1977.","journal-title":"Math. USSR Sbornik"},{"key":"6_CR12","first-page":"34","volume":"1249","author":"J. Niehren","year":"1997","unstructured":"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\u201348, 1997.","journal-title":"LNCS"},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1145\/321752.321764","volume":"20","author":"T. Pietrzykowski","year":"1973","unstructured":"T. Pietrzykowski. A complete mechanization of second-order type theory. J. ACM, 20:333\u2013364, 1973.","journal-title":"J. ACM"},{"key":"6_CR14","volume-title":"Internal Report 12\/94","author":"M. Schmidt-Schau\u00df","year":"1994","unstructured":"M. Schmidt-Schau\u00df. Unification of stratified second-order terms. Internal Report 12\/94, Fachbereich Informatik, Universit\u00e4t Frankfurt, Germany, 1994."},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"M. Schmidt-Schau\u00df. An algorithm for distributive unification. In Proc. of the 7th Int. Conf. on Rewriting Techniques and Applications, volume 1103 of LNCS, pages 287\u2013301, 1996.","DOI":"10.1007\/3-540-61464-8_60"},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/S0747-7171(89)80023-9","volume":"8","author":"W. Snyder","year":"1989","unstructured":"W. Snyder and J. Gallier. Higher-order unification revisited: Complete sets of transformations. J. Symbolic Computation, 8:101\u2013140, 1989.","journal-title":"J. Symbolic Computation"}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0052361","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,10]],"date-time":"2019-02-10T17:18:49Z","timestamp":1549819129000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0052361"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540643012","9783540697213"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/bfb0052361","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}