{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T17:18:00Z","timestamp":1773249480377,"version":"3.50.1"},"reference-count":16,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2000,8,1]],"date-time":"2000-08-01T00:00:00Z","timestamp":965088000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2000,8]]},"DOI":"10.1016\/s0020-0190(00)00086-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T20:45:05Z","timestamp":1027629905000},"page":"127-132","source":"Crossref","is-referenced-by-count":34,"title":["Clique polynomials have a unique root of smallest modulus"],"prefix":"10.1016","volume":"75","author":[{"given":"Massimiliano","family":"Goldwurm","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Massimo","family":"Santini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(00)00086-7_ID003","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1051\/ita\/1998324-601411","article-title":"Analysis of algorithms for the recognition of rational and context-free trace languages","volume":"Vol. 32","author":"Avellone","year":"1998","journal-title":"Theoret. Inform. Appl."},{"key":"10.1016\/S0020-0190(00)00086-7_ID004","series-title":"Codage Symbolique","author":"B\u00e9al","year":"1993"},{"key":"10.1016\/S0020-0190(00)00086-7_ID005","series-title":"Rational Series and Their Languages","author":"Berstel","year":"1988"},{"key":"10.1016\/S0020-0190(00)00086-7_ID006","series-title":"Applicable Algebra, Error-Correcting Codes, Combinatorics and Computer Algebra (Proceedings AAECC 4), Karlsruhe (FRG), September 23\u201326, 1986","first-page":"202","article-title":"Analysis of a class of algorithms for problems on trace languages","volume":"Vol. 307","author":"Bertoni","year":"1988"},{"key":"10.1016\/S0020-0190(00)00086-7_ID007","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0890-5401(89)90051-5","article-title":"Membership problems for regular and context free trace languages","volume":"Vol. 82","author":"Bertoni","year":"1989","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0020-0190(00)00086-7_ID008","series-title":"Probl\u00e8mes Combinatoires de Commutation et R\u00e9arrangements","volume":"Vol. 85","author":"Cartier","year":"1969"},{"key":"10.1016\/S0020-0190(00)00086-7_ID009","series-title":"Structural Models: An Introduction to the Theory of Directed Graphs","author":"Cartwright","year":"1965"},{"key":"10.1016\/S0020-0190(00)00086-7_ID010","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/S0012-365X(98)00211-8","article-title":"Determinants and M\u00f6bius functions in trace monoids","volume":"Vol. 194","author":"Choffrut","year":"1999","journal-title":"Discrete Math."},{"key":"10.1016\/S0020-0190(00)00086-7_ID011","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0304-3975(93)90229-M","article-title":"M\u00f6bius functions and confluent semi-commutations","volume":"Vol. 108","author":"Diekert","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(00)00086-7_ID012","series-title":"Algebraic Engineering, Proc. Internat. Workshop on Formal Languages and Computer Systems, Kyoto, Japan, 18\u201321 March, 1997, and the 1st Internat. Conference on Semigroups and Algebraic Engineering, Aizu, Japan, 24\u201328 March, 1997","first-page":"330","article-title":"Some identities related to automata, determinants, and M\u00f6bius functions","author":"Diekert","year":"1997"},{"key":"10.1016\/S0020-0190(00)00086-7_ID013","series-title":"Handbook of Formal Languages: Beyond Words","first-page":"457","article-title":"Partial commutation and traces","author":"Diekert","year":"1997"},{"key":"10.1016\/S0020-0190(00)00086-7_ID014","series-title":"The Book of Traces","year":"1995"},{"key":"10.1016\/S0020-0190(00)00086-7_ID015","series-title":"Clique polynomials and trace monoids, Rapporto Interno No. 222\u201398","author":"Goldwurm","year":"1998"},{"key":"10.1016\/S0020-0190(00)00086-7_ID016","series-title":"Automata-Theoretic Aspects of Formal Power Series","author":"Salomaa","year":"1978"},{"key":"10.1016\/S0020-0190(00)00086-7_ID017","series-title":"Non-Negative Matrices and Markov Chains","author":"Seneta","year":"1981"},{"key":"10.1016\/S0020-0190(00)00086-7_ID018","series-title":"Linear Algebra","author":"Shilov","year":"1977"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019000000867?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019000000867?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,21]],"date-time":"2019-04-21T04:23:47Z","timestamp":1555820627000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019000000867"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,8]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2000,8]]}},"alternative-id":["S0020019000000867"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(00)00086-7","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2000,8]]}}}