{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,3]],"date-time":"2023-01-03T09:31:50Z","timestamp":1672738310404},"reference-count":14,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1987,1,1]],"date-time":"1987-01-01T00:00:00Z","timestamp":536457600000},"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":9694,"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":[[1987]]},"DOI":"10.1016\/0304-3975(87)90071-5","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"307-317","source":"Crossref","is-referenced-by-count":5,"title":["Cyclic automata"],"prefix":"10.1016","volume":"53","author":[{"given":"Max","family":"Garzon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(87)90071-5_BIB1","first-page":"155","article-title":"Automata on a 2-dimensional tape","author":"Blum","year":"1967","journal-title":"Proc. 8th IEEE Conf. on SWAT"},{"key":"10.1016\/0304-3975(87)90071-5_BIB2","unstructured":"M. Garzon, Cayley automata, submitted."},{"key":"10.1016\/0304-3975(87)90071-5_BIB3","series-title":"Introduction to Formal Language Theory","author":"Harrison","year":"1978"},{"issue":"14","key":"10.1016\/0304-3975(87)90071-5_BIB4","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1007\/BF00289513","article-title":"On non-determinacy in simple computing devices","volume":"1","author":"Hartmanis","year":"1972","journal-title":"Acta Inform."},{"issue":"4","key":"10.1016\/0304-3975(87)90071-5_BIB5","doi-asserted-by":"crossref","first-page":"524","DOI":"10.1137\/0207042","article-title":"The unsolvability of the equivalence problem for \u03b5-free NGSM's with unary input (output) alphabet and applications","volume":"7","author":"Ibarra","year":"1978","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(87)90071-5_BIB6","series-title":"Combinatorial Group Theory","author":"Magnus","year":"1976"},{"key":"10.1016\/0304-3975(87)90071-5_BIB7","first-page":"69","article-title":"Eine Bemrekung zu einer Arbeit von Monien \u00fcber Kopfzahl Hierarchien f\u00fcr Zweiweg-Automaten","volume":"18","author":"Meinhardt","year":"1982","journal-title":"Elektron. Informationsverarb. Kybernet."},{"key":"10.1016\/0304-3975(87)90071-5_BIB8_1","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF00263746","article-title":"Transformational methods and their applications to complexity problems","volume":"6","author":"Monien","year":"1976","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(87)90071-5_BIB8_2","first-page":"383","article-title":"Transformational methods and their applications to complexity problems","volume":"8","author":"Monien","year":"1977","journal-title":"Corrigenda"},{"key":"10.1016\/0304-3975(87)90071-5_BIB9","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1051\/ita\/1980140100671","article-title":"Two-way multihead automata over a one-letter alphabet","volume":"14","author":"Monien","year":"1980","journal-title":"RAIRO Inform. Th\u00e9or."},{"key":"10.1016\/0304-3975(87)90071-5_BIB10","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/S0022-0000(77)80041-X","article-title":"Techniques for separating complexity classes","volume":"14","author":"Seiferas","year":"1977","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(87)90071-5_BIB11","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/S0022-0000(77)80042-1","article-title":"Relating refined space complexity","volume":"14","author":"Seiferas","year":"1977","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(87)90071-5_BIB12","first-page":"208","article-title":"Separating tape-bounded auxiliary pushdown automata classes","volume":"9","author":"Sudborough","year":"1977","journal-title":"Proc. ACM Symp. Theory of Computing"},{"key":"10.1016\/0304-3975(87)90071-5_BIB13","series-title":"Graphs, Groups and Surfaces","author":"White","year":"1984"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397587900715?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397587900715?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:52:42Z","timestamp":1555127562000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397587900715"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"references-count":14,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1987]]}},"alternative-id":["0304397587900715"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(87)90071-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1987]]}}}