{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T08:01:14Z","timestamp":1648713674118},"reference-count":27,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1994,9,1]],"date-time":"1994-09-01T00:00:00Z","timestamp":778377600000},"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":6894,"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,9]]},"DOI":"10.1016\/0304-3975(94)90238-0","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"319-336","source":"Crossref","is-referenced-by-count":13,"title":["Deterministic versus nondeterministic space in terms of synchronized alternating machines"],"prefix":"10.1016","volume":"132","author":[{"given":"Juraj","family":"Hromkovic\u02c7","sequence":"first","affiliation":[]},{"given":"Branislav","family":"Rovan","sequence":"additional","affiliation":[]},{"given":"Anna","family":"Slobodova","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/0304-3975(94)90238-0_bib1","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/322234.322243","article-title":"Alternation","volume":"28","author":"Chandra","year":"1981","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(94)90238-0_bib2","series-title":"Proc. 14th MFCS '89","first-page":"196","article-title":"On the power of synchronization in parallel computations","volume":"Vol. 379","author":"Dassow","year":"1989"},{"key":"10.1016\/0304-3975(94)90238-0_bib3","series-title":"Proc. 15th MFCS '90","first-page":"292","article-title":"On possibilities of one-way synchronized alternating and alternating finite automata","volume":"Vol. 459","author":"Geidmanis","year":"1990"},{"key":"10.1016\/0304-3975(94)90238-0_bib4","first-page":"179","article-title":"Hiearchies of memory limited computations","author":"Hartmanis","year":"1965","journal-title":"Proc. 6th Ann. IEEE Symp. on Switching Circuit Theory and Logical Design"},{"key":"10.1016\/0304-3975(94)90238-0_bib5","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/BF00290734","article-title":"One-way multihead deterministic finite automata","volume":"19","author":"Hromkovic\u02c7","year":"1983","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(94)90238-0_bib6","first-page":"28","article-title":"On the power of alternation in automata theory","volume":"31","author":"Hromkovic\u02c7","year":"1985","journal-title":"J. Comput. Sci."},{"key":"10.1016\/0304-3975(94)90238-0_bib7","series-title":"How to organize the communication among parallel processes in alternating computations","author":"Hromkovic\u02c7","year":"1986"},{"key":"10.1016\/0304-3975(94)90238-0_bib8","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0304-3975(89)90078-9","article-title":"Tradeoffs for language recognition on alternating machines","volume":"63","author":"Hromkovic\u02c7","year":"1989","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)90238-0_bib9","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/0304-3975(93)90203-6","article-title":"A note on realtime one-way synchronized alternating one-counter automata","volume":"108","author":"Hromkovic\u02c7","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)90238-0_bib10","first-page":"90","article-title":"On the power of two-dimensional synchronized alternating finite automata","volume":"15","author":"Hromkovic\u02c7","year":"1991","journal-title":"Fund. Inform."},{"key":"10.1016\/0304-3975(94)90238-0_bib11","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1142\/S0129054192000073","article-title":"On the power of one-way synchronized alternating machines with small space","volume":"3","author":"Hromkovic\u02c7","year":"1992","journal-title":"Internat. Found. Comput. Sci."},{"key":"10.1016\/0304-3975(94)90238-0_bib12","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0166-218X(91)90098-H","article-title":"On the power of synchronization in parallel computations","volume":"32","author":"Hromkovic\u02c7","year":"1991","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0304-3975(94)90238-0_bib13","series-title":"Proc. 8th FCT '91","first-page":"248","article-title":"On space-bounded synchronized alternating Turing machines","volume":"Vol. 529","author":"Ibarra","year":"1991"},{"key":"10.1016\/0304-3975(94)90238-0_bib14","series-title":"Proc. 19th ICALP '92","first-page":"126","article-title":"New results concerning synchronized finite automata","volume":"Vol. 623","author":"Ibarra","year":"1992"},{"issue":"5","key":"10.1016\/0304-3975(94)90238-0_bib15","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1137\/0217058","article-title":"Nondeterministic space is closed under complementation,","volume":"17","author":"Immerman","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(94)90238-0_bib16","series-title":"Ph.D. Dissertation","article-title":"Alternating finite automata","author":"King","year":"1981"},{"key":"10.1016\/0304-3975(94)90238-0_bib17","series-title":"Proc. 8th ICALP '81","first-page":"506","article-title":"Alternating multihead finite automata","volume":"Vol. 115","author":"King","year":"1981"},{"key":"10.1016\/0304-3975(94)90238-0_bib18","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1147\/rd.105.0388","article-title":"On multihead finite automata","volume":"25","author":"Rosenberg","year":"1966","journal-title":"IBM J. Res. Develop."},{"key":"10.1016\/0304-3975(94)90238-0_bib19","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1145\/322063.322076","article-title":"k + 1 heads are better than k","volume":"25","author":"Rivest","year":"1978","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(94)90238-0_bib20","series-title":"Student Research Papers Competition, Section Computer Science","article-title":"On the power of communication in alternating computations","author":"Slobodov\u00e1","year":"1987"},{"key":"10.1016\/0304-3975(94)90238-0_bib21","series-title":"Proc. 13th MFCS'888","first-page":"518","article-title":"On the power of communication in alternating machines","volume":"Vol. 324","author":"Slobodov\u00e1","year":"1988"},{"key":"10.1016\/0304-3975(94)90238-0_bib22","series-title":"Proc. 5th IMYCS '88","first-page":"209","article-title":"Some properties of space-bounded synchronized alternating Turing machines with only universal states","author":"Slobodov\u00e1","year":"1988"},{"key":"10.1016\/0304-3975(94)90238-0_bib23","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0020-0190(90)90099-J","article-title":"One-way globally deterministic synchronized alternating finite automata recognize exactly deterministic context-sensitive languages","volume":"36","author":"Slobodov\u00e1","year":"1990","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(94)90238-0_bib24","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1016\/0304-3975(92)90346-H","article-title":"Some properties of space-bounded synchronized alternating Turing machines with universal states only","volume":"96","author":"Slobodov\u00e1","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)90238-0_bib25","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF00299636","article-title":"The method of forced enumeration for nondeterministic automata","volume":"26","author":"Szelepcs\u00e9nyi","year":"1988","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(94)90238-0_bib26","volume":"Vol. 19","author":"Wagner","year":"1986"},{"issue":"10","key":"10.1016\/0304-3975(94)90238-0_bib27","first-page":"499","article-title":"On the power of synchronization","volume":"25","author":"Wiedermann","year":"1989","journal-title":"J. Inform. Process. Cybern. EIK"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594902380?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594902380?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:28:43Z","timestamp":1555129723000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397594902380"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,9]]},"references-count":27,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1994,9]]}},"alternative-id":["0304397594902380"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)90238-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1994,9]]}}}