{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T17:38:56Z","timestamp":1720201136030},"reference-count":20,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1985,1,1]],"date-time":"1985-01-01T00:00:00Z","timestamp":473385600000},"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":10424,"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":[[1985]]},"DOI":"10.1016\/0304-3975(85)90137-9","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T04:04:58Z","timestamp":1052798698000},"page":"171-188","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Syst\u00e8mes entiers d'\u00e9quations sur un alphabet fini et conjecture d'ehrenfeucht"],"prefix":"10.1016","volume":"39","author":[{"given":"Jean-Claude","family":"Spehner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(85)90137-9_BIB1","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1016\/S0019-9958(82)80028-4","article-title":"Test sets for context-free languages and algebraic systems of equations in a free monoid","volume":"52","author":"Albert","year":"1982","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(85)90137-9_BIB2","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/BF02572484","article-title":"Some algorithms on the star operation applied to finite language","volume":"28","author":"Almeida","year":"1984","journal-title":"Semigroup Forum"},{"key":"10.1016\/0304-3975(85)90137-9_BIB3","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0012-365X(83)90152-8","article-title":"Systems of equations over a free monoid and Ehrenfeucht Conjecture","volume":"43","author":"Culik","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/0304-3975(85)90137-9_BIB4","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0022-0000(78)90002-8","article-title":"On the decidability of homomorphism equivalence for languages","volume":"17","author":"Culik","year":"1978","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(85)90137-9_BIB5","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/0022-0000(80)90013-6","article-title":"Test sets and checking words for homomorphism equivalence","volume":"19","author":"Culik","year":"1980","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(85)90137-9_BIB6","volume":"Vol. A","author":"Eilenberg","year":"1974"},{"key":"10.1016\/0304-3975(85)90137-9_BIB7","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/0021-8693(83)90119-9","article-title":"On binary equality sets and a solution to the test conjecture in the binary case","volume":"85","author":"Ehrenfeucht","year":"1983","journal-title":"J. Algebra"},{"key":"10.1016\/0304-3975(85)90137-9_BIB8","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0304-3975(84)90004-5","article-title":"The Ehrenfeucht Conjecture: A compactness claim for finitely generated free monoids","volume":"29","author":"Karhum\u00e4ki","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(85)90137-9_BIB9","unstructured":"M. Karpinski, ed., New Scottish Book of Problems, \u00e0 paraitre."},{"key":"10.1016\/0304-3975(85)90137-9_BIB10","series-title":"Semigroups and Combinatorial Applications","author":"Lallement","year":"1979"},{"key":"10.1016\/0304-3975(85)90137-9_BIB11","series-title":"Equations dans le Mono\u00efde Libre","author":"Lentin","year":"1972"},{"key":"10.1016\/0304-3975(85)90137-9_BIB12","series-title":"Combinatorics on Words","author":"Lothaire","year":"1983"},{"key":"10.1016\/0304-3975(85)90137-9_BIB13","first-page":"331","article-title":"On the immersion of associative systems in groups","volume":"6","author":"Malcev","year":"1939","journal-title":"Math. Sbornik (N.S.)"},{"key":"10.1016\/0304-3975(85)90137-9_BIB14","series-title":"Automata Theory","first-page":"278","article-title":"El\u00e9ments de la th\u00e9orie g\u00e9n\u00e9rale des codes","author":"Nivat","year":"1966"},{"key":"10.1016\/0304-3975(85)90137-9_BIB15","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0012-365X(84)90187-0","article-title":"Solutions principales et rang d'un syst\u00e8me d'\u00e9quations avec constantes dans le mono\u00efde libre","volume":"48","author":"P\u00e9cuchet","year":"1984","journal-title":"Discrete Math."},{"key":"10.1016\/0304-3975(85)90137-9_BIB16","first-page":"104","article-title":"A necessary and sufficient condition for unique decomposition of coded messages","volume":"8","author":"Sardinas","year":"1953","journal-title":"Convention records I.R.E."},{"key":"10.1016\/0304-3975(85)90137-9_BIB17","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1007\/BF02194863","article-title":"Quelques constructions et algorithmes relatifs aux sous-mono\u00efdes d'un mono\u00efde libre","volume":"9","author":"Spehner","year":"1975","journal-title":"Semigroup Forum"},{"key":"10.1016\/0304-3975(85)90137-9_BIB18","series-title":"Algebraic Theory of Semigroups","first-page":"545","article-title":"On external conjugation of submonoids of a free monoid","volume":"20","author":"Spehner","year":"1979"},{"key":"10.1016\/0304-3975(85)90137-9_BIB19","first-page":"116","article-title":"Les pr\u00e9sentations des sous-mono\u00efdes de rang 3 d'un mono\u00efde libre","volume":"855","author":"Spehner","year":"1978"},{"key":"10.1016\/0304-3975(85)90137-9_BIB20","series-title":"Publ. Math. No. 20","article-title":"Tout sous-mono\u00efde finiment engendr\u00e9 d'un mono\u00efde libre est finiment m-pr\u00e9sent\u00e9","author":"Spehner","year":"1984"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"fr","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397585901379?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397585901379?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T12:52:53Z","timestamp":1553172773000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397585901379"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"references-count":20,"alternative-id":["0304397585901379"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(85)90137-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1985]]}}}