{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T16:06:44Z","timestamp":1649088404908},"reference-count":12,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1997,4,1]],"date-time":"1997-04-01T00:00:00Z","timestamp":859852800000},"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":5951,"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":[[1997,4]]},"DOI":"10.1016\/s0304-3975(96)00093-x","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T19:53:40Z","timestamp":1051127620000},"page":"175-204","source":"Crossref","is-referenced-by-count":2,"title":["Monadic logic programs and functional complexity"],"prefix":"10.1016","volume":"176","author":[{"given":"Armando B.","family":"Matos","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(96)00093-X_BIB1","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1080\/00207168108803243","article-title":"Loop programs and polinomially computable functions","volume":"9","author":"Amihud","year":"1981","journal-title":"Internal. J. Comput. Math. A"},{"key":"10.1016\/S0304-3975(96)00093-X_BIB2","series-title":"Informal Proc of the Workshop on Structural Complexity and Recursion-Theoretic Methods in Logic programming","year":"1992"},{"key":"10.1016\/S0304-3975(96)00093-X_BIB3","series-title":"Finite Automata, Their Algebras and Grammars \u2014Towards a Theory of Formal Expressions","author":"B\u00fcchi","year":"1989"},{"key":"10.1016\/S0304-3975(96)00093-X_BIB4","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1137\/0205045","article-title":"Simple programs realize exactly Presburger formulas","volume":"5","author":"Cherniavsky","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(96)00093-X_BIB5","article-title":"Satisfiability of the smallest binary program","author":"Hanschke","year":"1993","journal-title":"Technical report, Deutsches Forschungszentrum f\u00fcr K\u00fcnstliche Intelligenz, RR-93-09"},{"key":"10.1016\/S0304-3975(96)00093-X_BIB6","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\/S0304-3975(96)00093-X_BIB7","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/S0304-3975(96)00093-X_BIB8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0022-0000(80)90001-X","article-title":"A characterization of time complexity by simple loop programs","volume":"20","author":"Kasai","year":"1980","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(96)00093-X_BIB9","series-title":"Progress in Artificial Intelligence \u2014 6th Portuguese Conf. on AI, EPIA'93","first-page":"150","article-title":"Regular languages and a class of logic programs","author":"Matos","year":"1993"},{"key":"10.1016\/S0304-3975(96)00093-X_BIB10","series-title":"Introduction to Mathematical Logic","author":"Mendelson","year":"1966"},{"key":"10.1016\/S0304-3975(96)00093-X_BIB11","series-title":"Proc. 22nd National Conf. of the ACM","first-page":"465","article-title":"The complexity of loop programs","author":"Meyer","year":"1967"},{"key":"10.1016\/S0304-3975(96)00093-X_BIB12","series-title":"Theory of Recursive Functions and Effective Computation","author":"Rogers","year":"1967"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439759600093X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439759600093X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T03:25:21Z","timestamp":1556508321000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439759600093X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,4]]},"references-count":12,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1997,4]]}},"alternative-id":["S030439759600093X"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(96)00093-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1997,4]]}}}