{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:58:41Z","timestamp":1725663521980},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540563938"},{"type":"electronic","value":"9783540475491"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56393-8_20","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:07:47Z","timestamp":1330254467000},"page":"272-286","source":"Crossref","is-referenced-by-count":4,"title":["Decidability of regularity and related properties of ground normal form languages"],"prefix":"10.1007","author":[{"given":"Gregory","family":"Kucherov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohamed","family":"Tajine","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"20_CR1","volume-title":"Th\u00e8se de Doctorat d'Universit\u00e9","author":"H. Comon","year":"1988","unstructured":"H. Comon. Unification et disunification. Th\u00e9ories et applications. Th\u00e8se de Doctorat d'Universit\u00e9, Institut Polytechnique de Grenoble (France), 1988."},{"key":"20_CR2","first-page":"445","volume-title":"volume 488 of Lecture Notes in Computer Science","author":"N. Dershowitz","year":"1991","unstructured":"N. Dershowitz, J.-P. Jouannaud, and J.W. Klop. Open problems in rewriting. In R. V. Book, editor, Proceedings 4th Conference on Rewriting Techniques and Applications, Como (Italy), volume 488 of Lecture Notes in Computer Science, pages 445\u2013456. Springer-Verlag, 1991."},{"key":"20_CR3","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0304-3975(85)90089-1","volume":"37","author":"J. H. Gallier","year":"1985","unstructured":"J.H. Gallier and R. V. Book. Reductions in tree replacement systems. Theoretical Computer Science, 37:123\u2013150, 1985.","journal-title":"Theoretical Computer Science"},{"key":"20_CR4","volume-title":"Tree automata","author":"F. G\u00e9cseg","year":"1984","unstructured":"F. G\u00e9cseg and M. Steinby. Tree automata. Akad\u00e9miai Kiad\u00f3, Budapest, Hungary, 1984."},{"key":"20_CR5","unstructured":"R. Gilleron. Decision problems for term rewriting systems and recognizable tree languages. Research Report IT 200, Laboratoire d'Informatique Fondamentale de Lille, 1990."},{"key":"20_CR6","unstructured":"R.L. Graham, B.L. Rothschild, and J.H Spencer. Ramsey theory. John Wiley and Sons, 1980."},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"D. Hofbauer and M. Huber. Computing linearizations using test sets. In Proceedings of the 3rd International Workshop on Conditional Term Rewriting Systems, 1992. this volume.","DOI":"10.1007\/3-540-56393-8_21"},{"key":"20_CR8","unstructured":"D. Hofbauer and M. Huber. Joint discussions, 1992."},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/BF00292110","volume":"24","author":"D. Kapur","year":"1987","unstructured":"D. Kapur, P. Narendran, and H. Zhang. On sufficient completeness and related properties of term rewriting systems. Acta Informatica, 24:395\u2013415, 1987.","journal-title":"Acta Informatica"},{"key":"20_CR10","volume-title":"Lecture Notes in Computer Science","author":"E. Kounalis","year":"1990","unstructured":"E. Kounalis. Pumping lemmas for tree languages generated by rewrite systems. In Fifteenth International Symposium on Mathematical Foundations of Computer Science, Bansk\u00e1 Bystrica (Czechoslovakia), Lecture Notes in Computer Science. Springer-Verlag, 1990."},{"key":"20_CR11","first-page":"221","volume-title":"volume 431 of Lecture Notes in Computer Science","author":"E. Kounalis","year":"1990","unstructured":"E. Kounalis. Testing for inductive (co)-reducibility. In A. Arnold, editor, Proceedings 15th CAAP, Copenhagen (Denmark), volume 431 of Lecture Notes in Computer Science, pages 221\u2013238. Springer-Verlag, May 1990."},{"key":"20_CR12","first-page":"299","volume-title":"volume 488 of Lecture Notes in Computer Science","author":"G. A. Kucherov","year":"1991","unstructured":"G. A. Kucherov. On relationship between term rewriting systems and regular tree languages. In R. V. Book, editor, Proceedings 4th Conference on Rewriting Techniques and Applications, Como (Italy), volume 488 of Lecture Notes in Computer Science, pages 299\u2013311. Springer-Verlag, April 1991."},{"key":"20_CR13","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/S0019-9958(85)80005-X","volume":"65","author":"D. Plaisted","year":"1985","unstructured":"D. Plaisted. Semantic confluence tests and completion methods. Information and Control, 65:182\u2013215, 1985.","journal-title":"Information and Control"}],"container-title":["Lecture Notes in Computer Science","Conditional Term Rewriting Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56393-8_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:03:34Z","timestamp":1605647014000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56393-8_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540563938","9783540475491"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-56393-8_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}