{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T06:07:53Z","timestamp":1776233273832,"version":"3.50.1"},"reference-count":13,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1990,4,1]],"date-time":"1990-04-01T00:00:00Z","timestamp":638928000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1990,4,1]],"date-time":"1990-04-01T00:00:00Z","timestamp":638928000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8508,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1990,4]]},"DOI":"10.1016\/0304-3975(90)90047-l","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:48:55Z","timestamp":1027640935000},"page":"65-94","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":81,"title":["Factorization forests of finite height"],"prefix":"10.1016","volume":"72","author":[{"given":"Imre","family":"Simon","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(90)90047-L_BIB1","series-title":"Theory of Codes","author":"Berstel","year":"1985"},{"key":"10.1016\/0304-3975(90)90047-L_BIB2","first-page":"245","article-title":"Van der Waerden's theorem on arithmetic progressions","volume":"16","author":"Brown","year":"1969","journal-title":"Notices Amer. Math. Soc."},{"key":"10.1016\/0304-3975(90)90047-L_BIB3","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1971.36.285","article-title":"An interesting combinatorial method in the theory of locally finite semigroups","volume":"36","author":"Brown","year":"1971","journal-title":"Pacific J. Math."},{"key":"10.1016\/0304-3975(90)90047-L_BIB4","series-title":"Recurrence in Ergodic Theory and Combinatorial Number Theory","author":"Furstenberg","year":"1981"},{"key":"10.1016\/0304-3975(90)90047-L_BIB5","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0022-0000(82)90051-4","article-title":"Limitedness theorem on finite automata with distance functions","volume":"24","author":"Hashiguchi","year":"1982","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(90)90047-L_BIB6","author":"Hashiguchi","year":"1986","journal-title":"Improved limitedness theorems on finite automata with distance functions"},{"key":"10.1016\/0304-3975(90)90047-L_BIB7","series-title":"An Introduction to Semigroup Theory","author":"Howie","year":"1976"},{"key":"10.1016\/0304-3975(90)90047-L_BIB8","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1016\/0021-8693(80)90080-0","article-title":"Un th\u00e9or\u00e8me de factorisation des produits d'endomorphismes de KN","volume":"63","author":"Jacob","year":"1980","journal-title":"J. Algebra"},{"key":"10.1016\/0304-3975(90)90047-L_BIB9","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1016\/0097-3165(72)90101-X","article-title":"G\u00e9n\u00e9ralisation du th\u00e9or\u00e8me de van der Waerden sur les semi-groupes r\u00e9p\u00e9titifs","volume":"12","author":"Justin","year":"1972","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/0304-3975(90)90047-L_BIB10","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/0012-365X(84)90092-X","article-title":"Two combinatorial properties of partitions of the free semigroup into finitely many parts","volume":"52","author":"Justin","year":"1984","journal-title":"Discrete Math."},{"key":"10.1016\/0304-3975(90)90047-L_BIB11","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0097-3165(86)90061-0","article-title":"On a natural extension of Jacob's ranks","volume":"43","author":"Justin","year":"1986","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/0304-3975(90)90047-L_BIB12","series-title":"Semigroups and Combinatorial Applications","author":"Lallement","year":"1979"},{"key":"10.1016\/0304-3975(90)90047-L_BIB13","series-title":"Graph Theory and Combinatorics","article-title":"Word Ramsey theorems","author":"Simon","year":"1984"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759090047L?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759090047L?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T03:42:05Z","timestamp":1762227725000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759090047L"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,4]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,4]]}},"alternative-id":["030439759090047L"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(90)90047-l","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1990,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Factorization forests of finite height","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0304-3975(90)90047-L","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1990 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}