{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T17:36:01Z","timestamp":1725730561646},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387708"},{"type":"electronic","value":"9783642387715"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38771-5_27","type":"book-chapter","created":{"date-parts":[[2013,6,10]],"date-time":"2013-06-10T02:16:25Z","timestamp":1370830585000},"page":"301-312","source":"Crossref","is-referenced-by-count":1,"title":["Finite Automata with Advice Tapes"],"prefix":"10.1007","author":[{"given":"U\u011fur","family":"K\u00fc\u00e7\u00fck","sequence":"first","affiliation":[]},{"given":"A. C. Cem","family":"Say","sequence":"additional","affiliation":[]},{"given":"Abuzer","family":"Yakary\u0131lmaz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","first-page":"191","volume":"28","author":"R. Karp","year":"1982","unstructured":"Karp, R., Lipton, R.: Turing machines that take advice. L\u2019Enseignement Mathematique\u00a028, 191\u2013209 (1982)","journal-title":"L\u2019Enseignement Mathematique"},{"key":"27_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/3-540-60246-1_121","volume-title":"Mathematical Foundations of Computer Science 1995","author":"C. Damm","year":"1995","unstructured":"Damm, C., Holzer, M.: Automata that take advice. In: H\u00e1jek, P., Wiedermann, J. (eds.) MFCS 1995. LNCS, vol.\u00a0969, pp. 149\u2013158. Springer, Heidelberg (1995)"},{"issue":"1","key":"27_CR3","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.tcs.2009.08.031","volume":"411","author":"K. Tadaki","year":"2010","unstructured":"Tadaki, K., Yamakami, T., Lin, J.C.H.: Theory of one-tape linear-time Turing machines. Theoretical Computer Science\u00a0411(1), 22\u201343 (2010)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"27_CR4","doi-asserted-by":"publisher","first-page":"800","DOI":"10.1145\/146585.146599","volume":"39","author":"C. Dwork","year":"1992","unstructured":"Dwork, C., Stockmeyer, L.: Finite state verifiers I: The power of interaction. Journal of the ACM\u00a039(4), 800\u2013828 (1992)","journal-title":"Journal of the ACM"},{"issue":"38-39","key":"27_CR5","doi-asserted-by":"publisher","first-page":"3436","DOI":"10.1016\/j.tcs.2010.05.038","volume":"411","author":"R. Freivalds","year":"2010","unstructured":"Freivalds, R.: Amount of nonconstructivity in deterministic finite automata. Theoretical Computer Science\u00a0411(38-39), 3436\u20133443 (2010)","journal-title":"Theoretical Computer Science"},{"key":"27_CR6","unstructured":"Yamakami, T.: Swapping lemmas for regular and context-free languages with advice. Computing Research Repository abs\/0808.4 (2008)"},{"issue":"6","key":"27_CR7","doi-asserted-by":"publisher","first-page":"941","DOI":"10.1142\/S0129054110007659","volume":"21","author":"T. Yamakami","year":"2010","unstructured":"Yamakami, T.: The roles of advice to one-tape linear-time Turing machines and finite automata. Int. J. Found. Comput. Sci.\u00a021(6), 941\u2013962 (2010)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"45","key":"27_CR8","doi-asserted-by":"publisher","first-page":"6432","DOI":"10.1016\/j.tcs.2011.07.013","volume":"412","author":"T. Yamakami","year":"2011","unstructured":"Yamakami, T.: Immunity and pseudorandomness of context-free languages. Theoretical Computer Science\u00a0412(45), 6432\u20136450 (2011)","journal-title":"Theoretical Computer Science"},{"key":"27_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1007\/978-3-642-28332-1_45","volume-title":"Language and Automata Theory and Applications","author":"T. Yamakami","year":"2012","unstructured":"Yamakami, T.: One-way reversible and quantum finite automata with advice. In: Dediu, A.-H., Mart\u00edn-Vide, C. (eds.) LATA 2012. LNCS, vol.\u00a07183, pp. 526\u2013537. Springer, Heidelberg (2012)"},{"key":"27_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-642-13523-1_5","volume-title":"Unconventional Computation","author":"R. Agadzanyan","year":"2010","unstructured":"Agadzanyan, R., Freivalds, R.: Finite state transducers with intuition. In: Calude, C.S., Hagiya, M., Morita, K., Rozenberg, G., Timmis, J. (eds.) Unconventional Computation. LNCS, vol.\u00a06079, pp. 11\u201320. Springer, Heidelberg (2010)"},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Computational Complexity: A Conceptual Perspective. Cambridge University Press (2008)","DOI":"10.1017\/CBO9780511804106"},{"issue":"6","key":"27_CR12","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1016\/j.ic.2011.01.008","volume":"279","author":"A. Yakary\u0131lmaz","year":"2011","unstructured":"Yakary\u0131lmaz, A., Say, A.C.C.: Unbounded-error quantum computation with small space bounds. Information and Computation\u00a0279(6), 873\u2013892 (2011)","journal-title":"Information and Computation"},{"issue":"1","key":"27_CR13","doi-asserted-by":"publisher","first-page":"70","DOI":"10.4018\/jncr.2010010104","volume":"1","author":"M. Hirvensalo","year":"2010","unstructured":"Hirvensalo, M.: Quantum automata with open time evolution. International Journal of Natural Computing Research\u00a01(1), 70\u201385 (2010)","journal-title":"International Journal of Natural Computing Research"},{"key":"27_CR14","unstructured":"Kondacs, A., Watrous, J.: On the power of quantum finite state automata. In: Proceedings of the 38th Annual Symposium on Foundations of Computer Science, FOCS 1997, pp. 66\u201375 (1997)"},{"key":"27_CR15","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1147\/rd.32.0198","volume":"3","author":"J.C. Shepherdson","year":"1959","unstructured":"Shepherdson, J.C.: The reduction of two\u2013way automata to one-way automata. IBM Journal of Research and Development\u00a03, 198\u2013200 (1959)","journal-title":"IBM Journal of Research and Development"},{"key":"27_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/3-540-09526-8_5","volume-title":"Mathematical Foundations of Computer Science 1979","author":"R. Freivalds","year":"1979","unstructured":"Freivalds, R.: Fast probabilistic algorithms. In: Becvar, J. (ed.) MFCS 1979. LNCS, vol.\u00a074, pp. 57\u201369. Springer, Heidelberg (1979)"},{"issue":"1","key":"27_CR17","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s11047-011-9270-0","volume":"11","author":"A. Yakaryilmaz","year":"2012","unstructured":"Yakaryilmaz, A., Freivalds, R., Say, A.C.C., Agadzanyan, R.: Quantum computation with write-only memory. Natural Computing\u00a011(1), 81\u201394 (2012)","journal-title":"Natural Computing"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38771-5_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T00:29:26Z","timestamp":1557793766000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38771-5_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387708","9783642387715"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38771-5_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}