{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T23:40:23Z","timestamp":1739922023341,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540249986"},{"type":"electronic","value":"9783540318569"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31856-9_14","type":"book-chapter","created":{"date-parts":[[2010,3,2]],"date-time":"2010-03-02T18:06:19Z","timestamp":1267553179000},"page":"170-181","source":"Crossref","is-referenced-by-count":4,"title":["Polylog-Time Reductions Decrease Dot-Depth"],"prefix":"10.1007","author":[{"given":"Christian","family":"Gla\u00dfer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_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":"14_CR2","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1016\/0022-0000(92)90014-A","volume":"44","author":"D.A. Mix Barrington","year":"1992","unstructured":"Mix Barrington, D.A., Compton, K., Straubing, H., Th\u00e9rien, D.: Regular languages in NC1. Journal of Computer and System Sciences\u00a044, 478\u2013499 (1992)","journal-title":"Journal of Computer and System Sciences"},{"key":"14_CR3","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":"14_CR4","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":"14_CR5","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":"14_CR6","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":"14_CR7","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":"14_CR8","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":"14_CR9","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":"14_CR10","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":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/3-540-46541-3_46","volume-title":"STACS 2000","author":"C. Gla\u00dfer","year":"2000","unstructured":"Gla\u00dfer, C., Schmitz, H.: Languages of dot-depth 3\/2. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol.\u00a01770, pp. 555\u2013566. Springer, Heidelberg (2000)"},{"issue":"1","key":"14_CR12","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1137\/S0097539792240467","volume":"26","author":"Y. Han","year":"1997","unstructured":"Han, Y., Hemaspaandra, L.A., Thierauf, T.: Threshold computation and cryptographic security. SIAM Journal on Computing\u00a026(1), 59\u201378 (1997)","journal-title":"SIAM Journal on Computing"},{"key":"14_CR13","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":"14_CR14","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1051\/ita\/1983170403211","volume":"17","author":"R. Knast","year":"1983","unstructured":"Knast, R.: A semigroup characterization of dot-depth one languages. RAIRO Inform. Theor.\u00a017, 321\u2013330 (1983)","journal-title":"RAIRO Inform. Theor."},{"key":"14_CR15","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":"14_CR16","volume-title":"Counterfree Automata","author":"R. McNaughton","year":"1971","unstructured":"McNaughton, R., Papert, S.: Counterfree Automata. MIT Press, Cambridge (1971)"},{"issue":"1-2","key":"14_CR17","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/S0304-3975(97)00005-4","volume":"194","author":"R. Niedermeier","year":"1998","unstructured":"Niedermeier, R., Rossmanith, P.: Unambiguous computations and locally definable acceptance types. Theoretical Computer Science\u00a0194(1-2), 137\u2013161 (1998)","journal-title":"Theoretical Computer Science"},{"key":"14_CR18","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/S0304-3975(96)00297-6","volume":"180","author":"P. P\u00e9ladeau","year":"1997","unstructured":"P\u00e9ladeau, P., Straubing, H., Th\u00e9rien, D.: Finite semigroup varieties defined by programs. Theoretical Computer Science\u00a0180, 325\u2013339 (1997)","journal-title":"Theoretical Computer Science"},{"key":"14_CR19","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":"14_CR20","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":"14_CR21","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":"Sch\u00fctzenberger, M.P.: On finite monoids having only trivial subgroups. Information and Control\u00a08, 190\u2013194 (1965)","journal-title":"Information and Control"},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"Spakowski, H., Tripathi, R.: On the power of unambiguity in alternating machines. Technical Report 851, University of Rochester (2004)","DOI":"10.1007\/11537311_12"},{"issue":"2","key":"14_CR23","doi-asserted-by":"crossref","first-page":"11","DOI":"10.24033\/msmf.309","volume":"16","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":"14_CR24","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. Izvestija Rossijskoj Akademii Nauk\u00a057, 51\u201390 (1993) (in Russian)","journal-title":"Izvestija Rossijskoj Akademii Nauk"},{"key":"14_CR25","unstructured":"Wagner, K.W.: A reducibility and complete sets for the dot-depth hierarchy (2001) (manuscript)"}],"container-title":["Lecture Notes in Computer Science","STACS 2005"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31856-9_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T23:09:52Z","timestamp":1739920192000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31856-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540249986","9783540318569"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31856-9_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}