{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:22:53Z","timestamp":1759638173519},"reference-count":25,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,5,1]],"date-time":"2000-05-01T00:00:00Z","timestamp":957139200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4825,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2000,5]]},"DOI":"10.1016\/s0304-3975(98)00174-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:38:29Z","timestamp":1027651109000},"page":"247-274","source":"Crossref","is-referenced-by-count":7,"title":["Congruential complements of ground term rewrite systems"],"prefix":"10.1016","volume":"238","author":[{"given":"S\u00e1ndor","family":"V\u00e1gv\u00f6lgyi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(98)00174-1_BIB1","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/S0019-9958(69)90065-5","article-title":"Tree generating regular systems","volume":"14","author":"Brainerd","year":"1969","journal-title":"Inform. Control"},{"key":"10.1016\/S0304-3975(98)00174-1_BIB2","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0304-3975(94)90267-4","article-title":"Decidability of reachability for disjoint union of term rewriting systems","volume":"126","author":"Caron","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00174-1_BIB3","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0304-3975(93)90108-6","article-title":"Complete axiomatizations of some quotient term algebras","volume":"118","author":"Comon","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00174-1_BIB4","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0304-3975(94)90101-5","article-title":"Bottom-up tree pushdown automata: classification and connection with rewrite systems","volume":"127","author":"Coquid\u00e9","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00174-1_BIB5","first-page":"187","article-title":"Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems","volume":"88","author":"Dauchet","year":"1990","journal-title":"Inform. Control"},{"key":"10.1016\/S0304-3975(98)00174-1_BIB6","doi-asserted-by":"crossref","unstructured":"M. Dauchet, S. Tison, The theory of ground rewrite systems is decidable, in: Proc. 5th IEEE Symp. on Logic in Computer Science, Philadelphia (1990) 242\u2013248.","DOI":"10.1109\/LICS.1990.113750"},{"key":"10.1016\/S0304-3975(98)00174-1_BIB7","series-title":"Computability, Complexity, and Languages","author":"Davis","year":"1983"},{"key":"10.1016\/S0304-3975(98)00174-1_BIB8","unstructured":"J. Engelfriet, Derivation trees of ground term rewriting systems, Technical Report 96-25, Department of Computer Science, Leiden University."},{"key":"10.1016\/S0304-3975(98)00174-1_BIB9","first-page":"175","article-title":"Congruential tree languages are the same as recognizable tree languages \u2013 A proof for a theorem of D. Kozen","volume":"39","author":"F\u00fcl\u00f6p","year":"1989","journal-title":"Bull. EATCS"},{"key":"10.1016\/S0304-3975(98)00174-1_BIB10","first-page":"186","article-title":"Ground term rewriting rules for the word problem of ground term equations","volume":"45","author":"F\u00fcl\u00f6p","year":"1991","journal-title":"Bull. EATCS"},{"key":"10.1016\/S0304-3975(98)00174-1_BIB11","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/s002360050073","article-title":"Minimal equational representations of recognizable tree languages","volume":"34","author":"F\u00fcl\u00f6p and S. V\u00e1gv\u00f6lgyi","year":"1997","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(98)00174-1_BIB12","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0304-3975(85)90089-1","article-title":"Reductions in tree replacement systems","volume":"37","author":"Gallier","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00174-1_BIB13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/138027.138032","article-title":"An algorithm for finding canonical sets of ground rewrite rules in polynomial time","volume":"40","author":"Gallier","year":"1993","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0304-3975(98)00174-1_BIB14","series-title":"Tree Automata","author":"G\u00e9cseg","year":"1984"},{"key":"10.1016\/S0304-3975(98)00174-1_BIB15","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/S0304-3975(96)00333-7","article-title":"Linear generalized semi-monadic rewrite systems effectively preserve recognizability","volume":"194","author":"Gyenizse","year":"1998","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00174-1_BIB16","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1145\/322217.322230","article-title":"Confluent reductions","volume":"27","author":"Huet","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(98)00174-1_BIB17","doi-asserted-by":"crossref","unstructured":"D. Kozen, Complexity of finitely presented algebras, Proc. 9th Ann. ACM Symp. on Theory of Computing, Boulder CO, 1977, pp. 164\u2013177.","DOI":"10.1145\/800105.803406"},{"key":"10.1016\/S0304-3975(98)00174-1_BIB18","doi-asserted-by":"crossref","unstructured":"D. Kozen, Partial automata and finitely generated congruences: an extension of Nerode's theorem, Report DAIMI PB-400, Computer Science Department of Aarhus University, Denmark, 1992.","DOI":"10.7146\/dpb.v21i400.6634"},{"key":"10.1016\/S0304-3975(98)00174-1_BIB19","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1006\/jsco.1996.0045","article-title":"On the modularity of normal forms in rewriting","volume":"22","author":"Marchiori","year":"1996","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/S0304-3975(98)00174-1_BIB20","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1006\/inco.1996.0028","article-title":"Proof lengths for equational completion","volume":"125","author":"Plaisted","year":"1996","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(98)00174-1_BIB21","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1016\/0022-0000(88)90014-1","article-title":"Deterministic tree pushdown automata and monadic tree rewriting systems","volume":"37","author":"Salomaa","year":"1988","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(98)00174-1_BIB22","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1006\/jsco.1993.1029","article-title":"A fast algorithm for generating reduced ground rewriting systems from a set of ground equations","volume":"15","author":"Snyder","year":"1993","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/S0304-3975(98)00174-1_BIB23","doi-asserted-by":"crossref","first-page":"1275","DOI":"10.1145\/227683.227689","article-title":"Termination for direct sums of left-linear complete term rewriting systems","volume":"42","author":"Toyama","year":"1995","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(98)00174-1_BIB24","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1016\/0304-3975(93)90127-F","article-title":"A fast algorithm for constructing a tree automaton recognizing a congruential tree language","volume":"115","author":"V\u00e1gv\u00f6lgyi","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00174-1_BIB25","unstructured":"S. V\u00e1gv\u00f6lgyi, Simple and minimal ground term equation systems, submitted."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598001741?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598001741?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T04:09:05Z","timestamp":1580875745000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598001741"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,5]]},"references-count":25,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,5]]}},"alternative-id":["S0304397598001741"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00174-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,5]]}}}