{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:36:17Z","timestamp":1725888977278},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319602516"},{"type":"electronic","value":"9783319602523"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-60252-3_8","type":"book-chapter","created":{"date-parts":[[2017,6,2]],"date-time":"2017-06-02T14:59:13Z","timestamp":1496415553000},"page":"102-113","source":"Crossref","is-referenced-by-count":2,"title":["Uncountable Realtime Probabilistic Classes"],"prefix":"10.1007","author":[{"given":"Maksims","family":"Dimitrijevs","sequence":"first","affiliation":[]},{"given":"Abuzer","family":"Yakary\u0131lmaz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,6,3]]},"reference":[{"issue":"5","key":"8_CR1","doi-asserted-by":"crossref","first-page":"1524","DOI":"10.1137\/S0097539795293639","volume":"26","author":"LM Adleman","year":"1997","unstructured":"Adleman, L.M., DeMarrais, J., Huang, M.D.A.: Quantum computability. SIAM J. Comput. 26(5), 1524\u20131540 (1997)","journal-title":"SIAM J. Comput."},{"key":"8_CR2","volume-title":"Chebyshev\u2019s theorem on the distribution of prime numbers","author":"K Chandrasekharan","year":"1968","unstructured":"Chandrasekharan, K.: Chebyshev\u2019s theorem on the distribution of prime numbers. Springer, Heidelberg (1968). pp. 63\u201383"},{"key":"8_CR3","unstructured":"Dimitrijevs, M., Yakary\u0131lmaz, A.: Uncountable classical and quantum complexity classes. In: Eigth Workshop on Non-Classical Models for Automata and Applications (NCMA2016), vol. 321, pp. 131\u2013146. Austrian Computer Society (2016). books@ocg.at"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/3-540-12689-9_101","volume-title":"Foundations of Computation Theory","author":"R Freivalds","year":"1983","unstructured":"Freivalds, R.: Space and reversal complexity of probabilistic one-way turing machines. In: Karpinski, M. (ed.) FCT 1983. LNCS, vol. 158, pp. 159\u2013170. Springer, Heidelberg (1983). doi:\n10.1007\/3-540-12689-9_101"},{"key":"8_CR5","first-page":"39","volume":"24","author":"R Freivalds","year":"1985","unstructured":"Freivalds, R.: Space and reversal complexity of probabilistic one-way turing machines. Ann. Discrete Math. 24, 39\u201350 (1985)","journal-title":"Ann. Discrete Math."},{"key":"8_CR6","doi-asserted-by":"publisher","unstructured":"Kan\u0327eps, J., Geidmanis, D., Freivalds, R.: Tally languages accepted by Monte Carlo pushdown automata. In: Rolim, J. (ed.) RANDOM 1997. LNCS, vol. 1269, pp. 187\u2013195. Springer, Heidelberg (1997). doi:\n10.1007\/3-540-63248-4_16","DOI":"10.1007\/3-540-63248-4_16"},{"key":"8_CR7","volume-title":"Computation: Finite and Infinite Machines","author":"M Minsky","year":"1967","unstructured":"Minsky, M.: Computation: Finite and Infinite Machines. Prentice-Hall, Upper Saddle River (1967)"},{"key":"8_CR8","unstructured":"Say, A.C.C., Yakary\u0131lmaz, A.: Magic coins are useful for small-space quantum machines. Technical report TR14-159, ECCC (2016)"},{"issue":"8","key":"8_CR9","doi-asserted-by":"crossref","first-page":"1243","DOI":"10.1142\/S0129054113500329","volume":"24","author":"A Yakary\u0131lmaz","year":"2013","unstructured":"Yakary\u0131lmaz, A., Say, A.C.C.: Tight bounds for the space complexity of nonregular language recognition by real-time machines. Int. J. Found. Comput. Sci. 24(8), 1243\u20131253 (2013)","journal-title":"Int. J. Found. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Descriptional Complexity of Formal Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-60252-3_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,2]],"date-time":"2017-06-02T15:01:05Z","timestamp":1496415665000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-60252-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319602516","9783319602523"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-60252-3_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}