{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:32:36Z","timestamp":1725456756483},"publisher-location":"Berlin\/Heidelberg","reference-count":13,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540529535"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0029621","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T00:33:46Z","timestamp":1133397226000},"page":"292-299","source":"Crossref","is-referenced-by-count":2,"title":["On possibilities of one-way synchronized and alternating automata"],"prefix":"10.1007","author":[{"given":"Dainis","family":"Geidmanis","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/322234.322243","volume":"28","author":"A.K. Chandra","year":"1981","unstructured":"A.K. Chandra, D.C. Kozen and L.E. Stockmeyer, Alternation, JACM 28 (1981), P. 114\u2013133.","journal-title":"JACM"},{"key":"30_CR2","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0020-0190(81)90057-0","volume":"13","author":"R. Freivalds","year":"1981","unstructured":"R. Freivalds, Projections of Languages Recognizable By Probabilistic And Alternating Finite Multitape Automata, Information Processing Letters, v.13, 1981, p. 195\u2013198.","journal-title":"Information Processing Letters"},{"key":"30_CR3","unstructured":"D. Geidmanis, On the Measure of Complexity for Alternating Finite Multitape Automata, In: Complexity Problems In Mathematical Logics, Kalinin State University Press, 1985, p.25\u201327. (Russian)"},{"key":"30_CR4","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1007\/3-540-18740-5_35","volume":"278","author":"D. Geidmanis","year":"1988","unstructured":"D. Geidmanis, On the Capabilities of Alternating and Nondeterministic Multitape Automata, Proc. Found. of Comp. Theory, Lect. Notes in Comp. Sci., Springer, 1988, V.278.P.150\u2013154.","journal-title":"Lect. Notes in Comp. Sci., Springer"},{"key":"30_CR5","unstructured":"D. Geidmanis, Unsolvability of the Emptiness Problem for Alternating 1-way Multi-head and Multi-tape Finite Automata Over Single-letter Alphabet, to be published."},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"S. Ginsburg, The Mathematical Theory of Context-Free Languages. McGraw Hill, 1966.","DOI":"10.1145\/321312.321318"},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"J. Hromkovi\u010d, On the Power of Alternation in Finite Automata, MFCS, LNCS 176, P.322\u2013329.","DOI":"10.1007\/BFb0030313"},{"key":"30_CR8","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/322047.322058","volume":"25","author":"O. H. Ibarra","year":"1978","unstructured":"Oscar H. Ibarra, Reversal bounded machines and their decision problems, JACM 25 (1978), P.116\u2013133.","journal-title":"JACM"},{"key":"30_CR9","first-page":"506","volume":"115","author":"K.N. King","year":"1981","unstructured":"K.N. King, Alternating multihead finite automata, Proc 8th ICALP, LNCS 115 (Springer, Berlin, 1981), P.506\u2013520.","journal-title":"LNCS"},{"key":"30_CR10","first-page":"279","volume":"191","author":"Y. Matijasevich","year":"1970","unstructured":"Y. Matijasevich, Enumerable Sets Are Diophantine, Dokl. Akad. Nauk SSSR, 1970, 191, P.279\u2013282 (in Russian). English translation in Soviet. Math. Dokl. 11, P.354\u2013357.","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"30_CR11","doi-asserted-by":"crossref","first-page":"521","DOI":"10.4064\/aa-27-1-521-553","volume":"27","author":"Y. Matijasevic","year":"1975","unstructured":"Y. Matijasevic, J. Robinson, Reduction of an arbitrary diophantine equation to one in 13 unknowns, Acta Arithmetica, 1975, 27, P.521\u2013553.","journal-title":"Acta Arithmetica"},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"M.O.Rabin and D.Scott, Finite automata and their decision problems. IBM Journal of Research and Development, 3(1959).","DOI":"10.1147\/rd.32.0114"},{"key":"30_CR13","first-page":"518","volume":"324","author":"A. Slobodova","year":"1988","unstructured":"A. Slobodova, On the Power of Communication in Alternating Machines, MFCS, LNCS 324 (Springer, Berlin, 1988), P.518\u2013526.","journal-title":"MFCS, LNCS"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1990"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0029621","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T04:15:29Z","timestamp":1586578529000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0029621"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540529535"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/bfb0029621","relation":{},"subject":[]}}