{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T23:09:37Z","timestamp":1767913777739,"version":"3.49.0"},"reference-count":16,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,5,1]],"date-time":"1994-05-01T00:00:00Z","timestamp":767750400000},"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":7017,"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":[[1994,5]]},"DOI":"10.1016\/0304-3975(94)90044-2","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:17:21Z","timestamp":1027642641000},"page":"287-312","source":"Crossref","is-referenced-by-count":10,"title":["Periodic sets of integers"],"prefix":"10.1016","volume":"127","author":[{"given":"Armando B.","family":"Matos","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)90044-2_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0304-3975(94)90044-2_BIB2","series-title":"Principles of Compiler Design","author":"Aho","year":"1974"},{"key":"10.1016\/0304-3975(94)90044-2_BIB3","series-title":"Regular Algebra and Finite Machines","author":"Conway","year":"1971"},{"key":"10.1016\/0304-3975(94)90044-2_BIB4","series-title":"Automata, Languages and Machines, Vol. A","author":"Eilenberg","year":"1974"},{"issue":"6","key":"10.1016\/0304-3975(94)90044-2_BIB5","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/367766.368168","article-title":"Algorithm 97: shortest path","volume":"5","author":"Floyd","year":"1962","journal-title":"Comm. ACM"},{"issue":"3","key":"10.1016\/0304-3975(94)90044-2_BIB6","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1145\/321127.321132","article-title":"Two families of languages related to Algol","volume":"9","author":"Ginsburg","year":"1962","journal-title":"J. ACM"},{"issue":"1","key":"10.1016\/0304-3975(94)90044-2_BIB7","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1051\/ro\/197509V100771","article-title":"Alg\u00e8bre lin\u00e9aire et cheminement dans un graphe","volume":"9","author":"Gondran","year":"1975","journal-title":"Rev. Fran\u00e7aise d' Automatique, Informatique et Recherche Op\u00e9rationnelle"},{"key":"10.1016\/0304-3975(94)90044-2_BIB8","first-page":"124","article-title":"Algorithms for determining relative star height","volume":"78","author":"Hashigushi","year":"1987","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(94)90044-2_BIB9","series-title":"Introduction to Automata Theory, Languages and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0304-3975(94)90044-2_BIB10","series-title":"Tech. Report CMU-CS-89-204","article-title":"Solution of the Frobenius problem","author":"Kannan","year":"1989"},{"key":"10.1016\/0304-3975(94)90044-2_BIB11","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0304-3975(77)90056-1","article-title":"Algebraic structures for transitive closure","volume":"4","author":"Lehmann","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)90044-2_BIB12","series-title":"Theory of Linear and Integer Programming","author":"Schrijver","year":"1989"},{"key":"10.1016\/0304-3975(94)90044-2_BIB13","first-page":"21","article-title":"Problem 7382","volume":"41","author":"Sylvester","year":"1884","journal-title":"Math. from the Ed. Times with Solutions"},{"issue":"3","key":"10.1016\/0304-3975(94)90044-2_BIB14","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1145\/322261.322273","article-title":"Fast algorithms for solving path problems","volume":"28","author":"Tarjan","year":"1981","journal-title":"J. ACM"},{"issue":"3","key":"10.1016\/0304-3975(94)90044-2_BIB15","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1145\/322261.322272","article-title":"A unified approach to path problems","volume":"28","author":"Tarjan","year":"1981","journal-title":"J. ACM"},{"issue":"1","key":"10.1016\/0304-3975(94)90044-2_BIB16","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/321105.321107","article-title":"A theorem on boolean matrices","volume":"9","author":"Warshall","year":"1962","journal-title":"J. ACM"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594900442?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594900442?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T09:58:48Z","timestamp":1555063128000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397594900442"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,5]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,5]]}},"alternative-id":["0304397594900442"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)90044-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1994,5]]}}}