{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T16:10:01Z","timestamp":1735747801549,"version":"3.32.0"},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1970,3,1]],"date-time":"1970-03-01T00:00:00Z","timestamp":5097600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Systems Theory"],"published-print":{"date-parts":[[1970,3]]},"DOI":"10.1007\/bf01705881","type":"journal-article","created":{"date-parts":[[2005,6,10]],"date-time":"2005-06-10T22:28:59Z","timestamp":1118442539000},"page":"24-28","source":"Crossref","is-referenced-by-count":1,"title":["A note on one-way and two-way automata"],"prefix":"10.1007","volume":"4","author":[{"given":"J.","family":"Hartmanis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01705881_CR1","first-page":"63","volume-title":"Sequential Machines: Selected Papers","author":"M. O. Rabin","year":"1964","unstructured":"M. O. Rabin andD. Scott, Finite automata and their decision problems,Sequential Machines: Selected Papers, E. F. Moore, Ed., pp. 63\u201391. Addison-Wesley, Reading, Mass., 1964."},{"key":"BF01705881_CR2","first-page":"92","volume-title":"Sequential Machines: Selected Papers","author":"J. C. Shepherdson","year":"1964","unstructured":"J. C. Shepherdson, The reduction of two-way automata to one-way automata,Sequential Machines: Selected Papers, E. F. Moore, Ed., pp. 92\u201397, Addison-Wesley, Reading, Mass., 1964."},{"key":"BF01705881_CR3","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1145\/321406.321410","volume":"14","author":"R. M. Karp","year":"1967","unstructured":"R. M. Karp, Some bounds on the storage requirements of sequential machines and Turing machines,J. Assoc. Comput. Mach. 14 (1967), 478\u2013489.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF01705881_CR4","doi-asserted-by":"crossref","unstructured":"J. Hartmanis, P. M. Lewis, andR. E. Stearns, Hierarchies of memory limited computations, 1965IEEE Conference Record on Switching Circuit Theory and Logical Design, pp. 179\u2013190, Ann Arbor, Michigan.","DOI":"10.1109\/FOCS.1965.11"},{"key":"BF01705881_CR5","volume-title":"Formal Languages and their Relation to Automata","author":"J. E. Hopcroft","year":"1969","unstructured":"J. E. Hopcroft andJ. D. Ullman,Formal Languages and their Relation to Automata, Addison-Wesley, Reading, Mass., 1969."}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01705881.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01705881\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01705881","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T15:33:29Z","timestamp":1735745609000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01705881"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1970,3]]},"references-count":5,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1970,3]]}},"alternative-id":["BF01705881"],"URL":"https:\/\/doi.org\/10.1007\/bf01705881","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"type":"print","value":"0025-5661"},{"type":"electronic","value":"1433-0490"}],"subject":[],"published":{"date-parts":[[1970,3]]}}}