{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:37:41Z","timestamp":1725543461347},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540354284"},{"type":"electronic","value":"9783540354307"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11779148_37","type":"book-chapter","created":{"date-parts":[[2006,6,21]],"date-time":"2006-06-21T05:55:49Z","timestamp":1150869349000},"page":"408-419","source":"Crossref","is-referenced-by-count":0,"title":["Perfect Correspondences Between Dot-Depth and Polynomial-Time Hierarchy"],"prefix":"10.1007","author":[{"given":"Christian","family":"Gla\u00dfer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen","family":"Travers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Klaus W.","family":"Wagner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"37_CR1","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0304-3975(91)90268-7","volume":"91","author":"M. Arfi","year":"1991","unstructured":"Arfi, M.: Op\u00e9rations polynomiales et hi\u00e9rarchies de concat\u00e9nation. Theoretical Computer Science\u00a091, 71\u201384 (1991)","journal-title":"Theoretical Computer Science"},{"key":"37_CR2","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0304-3975(95)00032-R","volume":"148","author":"B. Borchert","year":"1995","unstructured":"Borchert, B.: On the acceptance power of regular languages. Theoretical Computer Science\u00a0148, 207\u2013225 (1995)","journal-title":"Theoretical Computer Science"},{"key":"37_CR3","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1051\/ita:1999116","volume":"33","author":"B. Borchert","year":"1999","unstructured":"Borchert, B., Kuske, D., Stephan, F.: On existentially first-order definable languages and their relation to NP. Theoretical Informatics and Applications\u00a033, 259\u2013269 (1999)","journal-title":"Theoretical Informatics and Applications"},{"key":"37_CR4","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0304-3975(92)90125-Y","volume":"104","author":"D.P. Bovet","year":"1992","unstructured":"Bovet, D.P., Crescenzi, P., Silvestri, R.: A uniform approach to define complexity classes. Theoretical Computer Science\u00a0104, 263\u2013283 (1992)","journal-title":"Theoretical Computer Science"},{"key":"37_CR5","first-page":"33","volume":"10","author":"J.A. Brzozowski","year":"1976","unstructured":"Brzozowski, J.A.: Hierarchies of aperiodic languages. RAIRO Inform. Theor.\u00a010, 33\u201349 (1976)","journal-title":"RAIRO Inform. Theor."},{"key":"37_CR6","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0022-0000(78)90049-1","volume":"16","author":"J.A. Brzozowski","year":"1978","unstructured":"Brzozowski, J.A., Knast, R.: The dot-depth hierarchy of star-free languages is infinite. Journal of Computer and System Sciences\u00a016, 37\u201355 (1978)","journal-title":"Journal of Computer and System Sciences"},{"key":"37_CR7","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1142\/S0129054198000180","volume":"9","author":"H.-J. Burtschick","year":"1998","unstructured":"Burtschick, H.-J., Vollmer, H.: Lindstr\u00f6m quantifiers and leaf language definability. International Journal of Foundations of Computer Science\u00a09, 277\u2013294 (1998)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"37_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0022-0000(71)80003-X","volume":"5","author":"R.S. Cohen","year":"1971","unstructured":"Cohen, R.S., Brzozowski, J.A.: Dot-depth of star-free events. Journal of Computer and System Sciences\u00a05, 1\u201316 (1971)","journal-title":"Journal of Computer and System Sciences"},{"key":"37_CR9","volume-title":"Automata, languages and machines","author":"S. Eilenberg","year":"1976","unstructured":"Eilenberg, S.: Automata, languages and machines, vol.\u00a0B. Academic Press, New York (1976)"},{"key":"37_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-540-31856-9_14","volume-title":"STACS 2005","author":"C. Gla\u00dfer","year":"2005","unstructured":"Gla\u00dfer, C.: Polylog-time reductions decrease dot-depth. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol.\u00a03404, pp. 170\u2013181. Springer, Heidelberg (2005)"},{"key":"37_CR11","doi-asserted-by":"crossref","unstructured":"Hertrampf, U., Lautemann, C., Schwentick, T., Vollmer, H., Wagner, K.W.: On the power of polynomial time bit-reductions. In: Proceedings 8th Structure in Complexity Theory, pp. 200\u2013207 (1993)","DOI":"10.1109\/SCT.1993.336526"},{"key":"37_CR12","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0304-3975(99)00278-9","volume":"245","author":"A. Maciel","year":"2000","unstructured":"Maciel, A., P\u00e9ladeau, P., Th\u00e9rien, D.: Programs over semigroups of dot\u2013depth one. Theoretical Computer Science\u00a0245, 135\u2013148 (2000)","journal-title":"Theoretical Computer Science"},{"key":"37_CR13","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/0022-0000(86)90037-1","volume":"32","author":"D. Perrin","year":"1986","unstructured":"Perrin, D., Pin, J.E.: First-order logic and star-free sets. Journal of Computer and System Sciences\u00a032, 393\u2013406 (1986)","journal-title":"Journal of Computer and System Sciences"},{"key":"37_CR14","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/BF02679467","volume":"30","author":"J.E. Pin","year":"1997","unstructured":"Pin, J.E., Weil, P.: Polynomial closure and unambiguous product. Theory of computing systems\u00a030, 383\u2013422 (1997)","journal-title":"Theory of computing systems"},{"key":"37_CR15","unstructured":"Schmitz, H.: The Forbidden-Pattern Approach to Concatenation Hierarchies. PhD thesis, Fakult\u00e4t f\u00fcr Mathematik und Informatik, Universit\u00e4t W\u00fcrzburg (2001)"},{"key":"37_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","volume":"3","author":"L. Stockmeyer","year":"1977","unstructured":"Stockmeyer, L.: The polynomial-time hierarchy. Theoretical Computer Science\u00a03, 1\u201322 (1977)","journal-title":"Theoretical Computer Science"},{"key":"37_CR17","doi-asserted-by":"crossref","first-page":"11","DOI":"10.24033\/msmf.309","volume":"16, 2","author":"W. Thomas","year":"1984","unstructured":"Thomas, W.: An application of the Ehrenfeucht\u2013Fra\u00efss\u00e9 game in formal language theory. Soci\u00e9t\u00e9 Math\u00e9matique de France, m\u00e9moire\u00a016, 2, 11\u201321 (1984)","journal-title":"Soci\u00e9t\u00e9 Math\u00e9matique de France, m\u00e9moire"},{"key":"37_CR18","first-page":"51","volume":"57","author":"N.K. Vereshchagin","year":"1993","unstructured":"Vereshchagin, N.K.: Relativizable and non-relativizable theorems in the polynomial theory of algorithms (in Russian). Izvestija Rossijskoj Akademii Nauk\u00a057, 51\u201390 (1993)","journal-title":"Izvestija Rossijskoj Akademii Nauk"},{"key":"37_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-540-31834-7_5","volume-title":"Machines, Computations, and Universality","author":"K.W. Wagner","year":"2005","unstructured":"Wagner, K.W.: Leaf language classes. In: Margenstern, M. (ed.) MCU 2004. LNCS, vol.\u00a03354, pp. 60\u201381. Springer, Heidelberg (2005)"},{"key":"37_CR20","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0304-3975(76)90062-1","volume":"3","author":"C. Wrathall","year":"1977","unstructured":"Wrathall, C.: Complete sets and the polynomial-time hierarchy. Theoretical Computer Science\u00a03, 23\u201333 (1977)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11779148_37.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:15:55Z","timestamp":1619507755000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11779148_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354284","9783540354307"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11779148_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}