{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T16:58:45Z","timestamp":1648745925941},"reference-count":21,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,2,1]],"date-time":"2000-02-01T00:00:00Z","timestamp":949363200000},"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":4915,"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,2]]},"DOI":"10.1016\/s0304-3975(98)00043-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T11:35:01Z","timestamp":1027596901000},"page":"217-231","source":"Crossref","is-referenced-by-count":2,"title":["Langages rationnels d\u00e9finis avec une concat\u00e9nation non-associative"],"prefix":"10.1016","volume":"233","author":[{"given":"Christian","family":"Germain","sequence":"first","affiliation":[]},{"given":"Jean","family":"Pallo","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(98)00043-7_BIB1","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1016\/S0019-9958(78)90510-7","article-title":"For\u00eats alg\u00e8briques et homomorphismes inverses","volume":"37","author":"Arnold","year":"1978","journal-title":"Inform. and Control"},{"key":"10.1016\/S0304-3975(98)00043-7_BIB2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0166-218X(80)90050-5","article-title":"Langages sur des alphabets infinis","volume":"2","author":"Autebert","year":"1980","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0304-3975(98)00043-7_BIB3","doi-asserted-by":"crossref","unstructured":"J. Berstel, C. Reutenauer, Rational Series and their Langages, EATCS Monographs on Theoretical Computer Science, vol. 12, Springer, Berlin, 1988.","DOI":"10.1007\/978-3-642-73235-5_4"},{"key":"10.1016\/S0304-3975(98)00043-7_BIB4","first-page":"17","article-title":"Quelques classes de groupo\u0131\u0308des non-associatifs","volume":"31","author":"D'Adhemar","year":"1970","journal-title":"Math. Sci. Hum."},{"key":"10.1016\/S0304-3975(98)00043-7_BIB5","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1080\/00207168908803729","article-title":"A weak associative axiom with decidable word problem and without equivalent canonical term rewriting system","volume":"28","author":"Del\u00e9age","year":"1989","journal-title":"Int. J. Comput. Math."},{"key":"10.1016\/S0304-3975(98)00043-7_BIB6","doi-asserted-by":"crossref","unstructured":"N. Dershowitz, J.P. Jouannaud, Rewrite systems, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, vol. B, Elsevier, Amsterdam, 1990, Chap. 6, pp. 243\u2013320.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"10.1016\/S0304-3975(98)00043-7_BIB7","series-title":"A Theory of Langage and Information: a Mathematical Approach","author":"Harris","year":"1991"},{"key":"10.1016\/S0304-3975(98)00043-7_BIB8","doi-asserted-by":"crossref","first-page":"983","DOI":"10.2307\/2371362","article-title":"Theory of quasi-groups","volume":"59","author":"Hausmann","year":"1937","journal-title":"Amer. J. Math."},{"key":"10.1016\/S0304-3975(98)00043-7_BIB9","first-page":"31","article-title":"An introduction to Kunth\u2013Bendix completion","volume":"1","author":"Klop","year":"1988","journal-title":"CWI Quaterly"},{"key":"10.1016\/S0304-3975(98)00043-7_BIB10","doi-asserted-by":"crossref","unstructured":"D.E. Knuth, P.B. Bendix, Simple word problems in universal algebras, in: J. Leech (Ed.), Computational Problems in Abstract Algebra, Pergamon Press, Oxford, 1969, pp. 263\u2013297.","DOI":"10.1016\/B978-0-08-012975-4.50028-X"},{"key":"10.1016\/S0304-3975(98)00043-7_BIB11","doi-asserted-by":"crossref","unstructured":"A.L. Kostrikin, I.R. Shafarevich (Eds.), Algebra VI, Encyclopaedia of Mathematical Sciences, vol. 57, Springer, Berlin, 1995.","DOI":"10.1007\/978-3-662-06292-0"},{"key":"10.1016\/S0304-3975(98)00043-7_BIB12","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1093\/comjnl\/34.5.438","article-title":"A survey on binary tree codings","volume":"34","author":"M\u00e4kinen","year":"1991","journal-title":"Comput. J."},{"key":"10.1016\/S0304-3975(98)00043-7_BIB13","doi-asserted-by":"crossref","unstructured":"U. Martin, How to choose the weights in the Knuth\u2013Bendix ordering, in: Proc. 2nd Int. Conf. on Rewriting Techniques and Applications, Bordeaux, France, Lecture Notes in Computer Science, vol. 256, Springer, Berlin, 1987, pp. 42\u201353.","DOI":"10.1007\/3-540-17220-3_4"},{"key":"10.1016\/S0304-3975(98)00043-7_BIB14","doi-asserted-by":"crossref","first-page":"509","DOI":"10.2307\/2371517","article-title":"Quasi-groups which satisfy certain generalized associative laws","volume":"61","author":"Murdoch","year":"1939","journal-title":"Amer. J. Math."},{"key":"10.1016\/S0304-3975(98)00043-7_BIB15","first-page":"289","article-title":"Mod\u00e8les associatif-relatif et commutatif coh\u00e9rents appliqu\u00e9s aux langages r\u00e9guliers","volume":"19","author":"Pallo","year":"1982","journal-title":"Calcolo"},{"key":"10.1016\/S0304-3975(98)00043-7_BIB16","first-page":"21","article-title":"Coding binary trees by embedding into the Roubaud's magma","volume":"2","author":"Pallo","year":"1986","journal-title":"Radovi Mat."},{"key":"10.1016\/S0304-3975(98)00043-7_BIB17","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1080\/00207168508803477","article-title":"A note on generating binary trees in A-order and B-order","volume":"18","author":"Pallo","year":"1985","journal-title":"Internat. J. Comput. Math."},{"key":"10.1016\/S0304-3975(98)00043-7_BIB18","first-page":"43","article-title":"La notion d'associativit\u00e9 relative","volume":"34","author":"Roubaud","year":"1971","journal-title":"Math. Sci. Hum."},{"key":"10.1016\/S0304-3975(98)00043-7_BIB19","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/BF01695769","article-title":"Mappings and grammars on trees","volume":"4","author":"Rounds","year":"1970","journal-title":"Math. Syst. Theor."},{"key":"10.1016\/S0304-3975(98)00043-7_BIB20","doi-asserted-by":"crossref","unstructured":"M. Steinby, Tree language problems in pattern recognition theory, in: J. Demerovics, J. Csirik, F. Gecseg (Eds.), Proc. 1989 Internat. Conf. on Fundamentals of Computation Theory, New York, Lecture Notes in Computer Science, vol. 380, Springer, Berlin, 1989, pp. 444\u2013450.","DOI":"10.1007\/3-540-51498-8_43"},{"key":"10.1016\/S0304-3975(98)00043-7_BIB21","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1090\/S0002-9947-1929-1501476-0","article-title":"On a generalization of the associative law","volume":"31","author":"Suschkewitsch","year":"1929","journal-title":"Trans. Amer. Math. Soc."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598000437?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598000437?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T06:51:11Z","timestamp":1578466271000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598000437"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,2]]},"references-count":21,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,2]]}},"alternative-id":["S0304397598000437"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00043-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,2]]}}}