{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:13:13Z","timestamp":1725484393095},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540441854"},{"type":"electronic","value":"9783540457510"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45751-8_15","type":"book-chapter","created":{"date-parts":[[2007,5,16]],"date-time":"2007-05-16T02:42:07Z","timestamp":1179283327000},"page":"222-234","source":"Crossref","is-referenced-by-count":2,"title":["Axiomatization of Finite Algebras"],"prefix":"10.1007","author":[{"given":"Jochen","family":"Burghardt","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,9,2]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"A. Aiken and B. Murphy. Implementing regular tree expressions. In ACM Conference on Functional Programming Languages and Computer Architecture, pages 427\u2013447, August 1991.","DOI":"10.1007\/3540543961_21"},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0304-3975(91)90307-N","volume":"90","author":"J.M. Barzdin","year":"1991","unstructured":"J.M. Barzdin and G.J. Barzdin. Rapid construction of algebraic axioms from samples. Theoretical Computer Science, 90:199\u2013208, 1991.","journal-title":"Theoretical Computer Science"},{"key":"15_CR3","unstructured":"Jochen Burghardt and Birgit Heinz. Implementing anti-unification modulo equational theory. Arbeitspapier 1006, GMD, Jun 1996."},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Jochen Burghardt. Axiomatization of finite algebras. Arbeitspapier, GMD, 2002. forthcoming.","DOI":"10.1007\/3-540-45751-8_15"},{"key":"15_CR5","unstructured":"H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree Automata Techniques and Applications. WWW, Available from http:\/\/www.grappa.univ-lille3.fr\/tata , Oct 1999."},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"N. Dershowitz and J.-P. Jouannaud. Rewrite Systems, volume B of Handbook of Theoretical Computer Science, pages 243\u2013320. Elsevier, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"15_CR7","volume-title":"Technical Report MPI-I-94-251","author":"P. Graf","year":"1994","unstructured":"Peter Graf. Substitution tree indexing. Technical Report MPI-I-94-251, Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Oct 1994."},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"David McAllester. Grammar rewriting. In Proc. CADE-11, volume 607 of LNAI. Springer, 1992.","DOI":"10.1007\/3-540-55602-8_160"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"K. Meinke and J.V. Tucker. Universal Algebra, volume 1 of Handbook of Logic in Computer Science. Clarendon, Oxford, 1992.","DOI":"10.1093\/oso\/9780198537359.003.0003"}],"container-title":["Lecture Notes in Computer Science","KI 2002: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45751-8_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,14]],"date-time":"2024-02-14T09:06:37Z","timestamp":1707901597000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45751-8_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441854","9783540457510"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-45751-8_15","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}