{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:22:32Z","timestamp":1725495752079},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540677154"},{"type":"electronic","value":"9783540450221"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-45022-x_75","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T23:57:25Z","timestamp":1194998245000},"page":"890-901","source":"Crossref","is-referenced-by-count":3,"title":["The Many Faces of a Translation"],"prefix":"10.1007","author":[{"given":"Pierre","family":"McKenzie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Schwentick","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Denis","family":"Th\u00e9rien","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Heribert","family":"Vollmer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,2,18]]},"reference":[{"key":"75_CR1","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1016\/0022-0000(92)90014-A","volume":"44","author":"D. A. M. Barrington","year":"1992","unstructured":"D. A. Mix Barrington, K. Compton, H. Straubing, and D. Th\u00e9rien. Regular languages in NC1. Journal of Computer and System Sciences, 44:478\u2013499, 1992.","journal-title":"Journal of Computer and System Sciences"},{"key":"75_CR2","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1016\/0022-0000(90)90022-D","volume":"41","author":"D. A. Mix Barrington","year":"1990","unstructured":"D. A. Mix Barrington, N. Immerman, and H. Straubing. On uniformity within NC1. Journal of Computer and System Sciences, 41:274\u2013306, 1990.","journal-title":"Journal of Computer and System Sciences"},{"key":"75_CR3","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1002\/malq.19600060105","volume":"6","author":"J. R. B\u00fcchi","year":"1960","unstructured":"J. R. B\u00fcchi. Weak second-order arithmetic and finite automata. Math. Logik. Grund. Math., 6:66\u201392, 1960.","journal-title":"Math. Logik. Grund. Math."},{"key":"75_CR4","volume-title":"Automata, Languages, and Machines","author":"S. Eilenberg","year":"1976","unstructured":"S. Eilenberg. Automata, Languages, and Machines, volume A. Academic Press, New York, 1976."},{"key":"75_CR5","volume-title":"Automata, Languages, and Machines","author":"S. Eilenberg","year":"1976","unstructured":"S. Eilenberg. Automata, Languages, and Machines, volume B. Academic Press, New York, 1976."},{"key":"75_CR6","doi-asserted-by":"crossref","unstructured":"J. E. Hopcroft and J. E. Ullman. An approach to a unified theory of automata. In Proceedings 8th Symposium on Switching and Automata Theory, pages 140\u2013147. IEEE Computer Society Press, 1967.","DOI":"10.1109\/FOCS.1967.4"},{"key":"75_CR7","series-title":"Addison-Wesley Series in Computer Science","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J. E. Hopcroft","year":"1979","unstructured":"J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley Series in Computer Science. Addison-Wesley, Reading, MA, 1979."},{"key":"75_CR8","series-title":"Graduate Texts in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0539-5","volume-title":"Descriptive Complexity","author":"N. Immerman","year":"1999","unstructured":"N. Immerman. Descriptive Complexity. Graduate Texts in Computer Science. Springer Verlag, New York, 1999."},{"key":"75_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1007\/3-540-49116-3_42","volume-title":"Proceedings 16th Symposium on Theoretical Aspects of Computer Science","author":"C. Lautemann","year":"1999","unstructured":"C. Lautemann, P. McKenzie, T. Schwentick, and H. Vollmer. The descriptive complexity approach to LOGCFL. In Proceedings 16th Symposium on Theoretical Aspects of Computer Science, volume 1563 of Lecture Notes in Computer Science, pages 444\u2013454. Springer Verlag, 1999."},{"key":"75_CR10","unstructured":"R. McNaughton and S. Papert. Counter-Free Automata. MIT Press, 1971."},{"key":"75_CR11","doi-asserted-by":"crossref","unstructured":"P. McKenzie, T. Schwentick, D. Th\u00e9rien, and H. Vollmer. The many faces of a translation. Technical Report 248, Institut f\u00fcr Informatik, Universit\u00e4t W\u00fcrzburg, 2000. URL: http:\/\/www.informatik.uni-wuerzburg.de\/reports\/tr.html .","DOI":"10.1007\/3-540-45022-X_75"},{"issue":"2","key":"75_CR12","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1147\/rd.32.0114","volume":"3","author":"M. O. Rabin","year":"1959","unstructured":"M. O. Rabin and D. Scott. Finite automata and their decision problems. IBM J. Res., 3(2):115\u2013125, 1959.","journal-title":"IBM J. Res."},{"key":"75_CR13","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/S0019-9958(65)90108-7","volume":"8","author":"M. P. Sch\u00fctzenberger","year":"1965","unstructured":"M. P. Sch\u00fctzenberger. On finite monoids having only trivial subgroups. Information & Control, 8:190\u2013194, 1965.","journal-title":"Information & Control"},{"issue":"2","key":"75_CR14","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1147\/rd.32.0198","volume":"3","author":"J. C. Sheperdson","year":"1959","unstructured":"J. C. Sheperdson. The reduction of two-way automata to one-way automata. IBM J. Res., 3(2):198\u2013200, 1959.","journal-title":"IBM J. Res."},{"key":"75_CR15","doi-asserted-by":"crossref","unstructured":"H. Straubing. Finite Automata, Formal Logic, and Circuit Complexity. Birkh\u00e4user, Boston, 1994.","DOI":"10.1007\/978-1-4612-0289-9"},{"key":"75_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1007\/3-540-19488-6_142","volume-title":"Proceedings 15th International Colloqium on Automata, Languages and Programming","author":"H. Straubing","year":"1988","unstructured":"H. Straubing, D. Th\u00e9rien, and W. Thomas. Regular languages defined with generalized quantifiers. In Proceedings 15th International Colloqium on Automata, Languages and Programming, volume 317 of Lecture Notes in Computer Science, pages 561\u2013575, Berlin Heidelberg, 1988. Springer Verlag."},{"key":"75_CR17","first-page":"326","volume":"140","author":"B. A. Trakhtenbrot","year":"1961","unstructured":"B. A. Trakhtenbrot. Finite automata and logic of monadic predicates. Doklady Akademii Nauk SSSR, 140:326\u2013329, 1961. In Russian.","journal-title":"Doklady Akademii Nauk SSSR"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45022-X_75","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T11:25:48Z","timestamp":1556969148000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45022-X_75"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540677154","9783540450221"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-45022-x_75","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}