{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T18:40:10Z","timestamp":1736620810608,"version":"3.32.0"},"reference-count":37,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2007,2,1]],"date-time":"2007-02-01T00:00:00Z","timestamp":1170288000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":2394,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[2007,2]]},"DOI":"10.1016\/j.jcss.2006.09.004","type":"journal-article","created":{"date-parts":[[2006,10,25]],"date-time":"2006-10-25T15:29:34Z","timestamp":1161790174000},"page":"36-56","source":"Crossref","is-referenced-by-count":4,"title":["Languages polylog-time reducible to dot-depth 1\/2"],"prefix":"10.1016","volume":"73","author":[{"given":"Christian","family":"Gla\u00dfer","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.jcss.2006.09.004_bib001","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0304-3975(91)90268-7","article-title":"Op\u00e9rations polynomiales et hi\u00e9rarchies de concat\u00e9nation","volume":"91","author":"Arfi","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.jcss.2006.09.004_bib002","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1016\/0022-0000(92)90014-A","article-title":"Regular languages in NC1","volume":"44","author":"Mix Barrington","year":"1992","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/j.jcss.2006.09.004_bib003","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/S0019-9958(82)90439-9","article-title":"On the unique satisfiability problem","volume":"82","author":"Blass","year":"1982","journal-title":"Inform. Control"},{"key":"10.1016\/j.jcss.2006.09.004_bib004","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0304-3975(95)00032-R","article-title":"On the acceptance power of regular languages","volume":"148","author":"Borchert","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.jcss.2006.09.004_bib005","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1051\/ita:1999116","article-title":"On existentially first-order definable languages and their relation to NP","volume":"33","author":"Borchert","year":"1999","journal-title":"Theoret. Inform. Appl."},{"key":"10.1016\/j.jcss.2006.09.004_bib006","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0304-3975(92)90125-Y","article-title":"A uniform approach to define complexity classes","volume":"104","author":"Bovet","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.jcss.2006.09.004_bib007","first-page":"33","article-title":"Hierarchies of aperiodic languages","volume":"10","author":"Brzozowski","year":"1976","journal-title":"RAIRO Inform. Theor."},{"key":"10.1016\/j.jcss.2006.09.004_bib008","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0022-0000(78)90049-1","article-title":"The dot-depth hierarchy of star-free languages is infinite","volume":"16","author":"Brzozowski","year":"1978","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/j.jcss.2006.09.004_bib009","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1142\/S0129054198000180","article-title":"Lindstr\u00f6m quantifiers and leaf language definability","volume":"9","author":"Burtschick","year":"1998","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"10.1016\/j.jcss.2006.09.004_bib010","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0022-0000(71)80003-X","article-title":"Dot-depth of star-free events","volume":"5","author":"Cohen","year":"1971","journal-title":"J. Comput. System Sci."},{"year":"1976","series-title":"Automata, Languages and Machines, vol. B","author":"Eilenberg","key":"10.1016\/j.jcss.2006.09.004_bib011"},{"key":"10.1016\/j.jcss.2006.09.004_bib012","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/BF01368782","article-title":"Simultaneous strong separations of probabilistic and unambiguous complexity classes","volume":"25","author":"Eppstein","year":"1992","journal-title":"Math. Syst. Theory"},{"key":"10.1016\/j.jcss.2006.09.004_bib013","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1016\/S0022-0000(05)80024-8","article-title":"Gap-definable counting classes","volume":"48","author":"Fenner","year":"1994","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/j.jcss.2006.09.004_bib014","unstructured":"C. Gla\u00dfer, H. Schmitz, Languages of dot-depth 3\/2, Theory Comput. Syst., in press"},{"key":"10.1016\/j.jcss.2006.09.004_bib015","series-title":"Proceedings 17th Symposium on Theoretical Aspects of Computer Science","first-page":"555","article-title":"Languages of dot-depth 3\/2","volume":"vol. 1770","author":"Gla\u00dfer","year":"2000"},{"key":"10.1016\/j.jcss.2006.09.004_bib016","series-title":"Proceedings 12th Symposium on Mathematical Foundations of Computer Science","first-page":"396","article-title":"Nondeterministic Turing machines with modified acceptance","volume":"vol. 233","author":"Gundermann","year":"1986"},{"key":"10.1016\/j.jcss.2006.09.004_bib017","series-title":"Proceedings 6th Structure in Complexity Theory","first-page":"43","article-title":"The power of witness reduction","author":"Gupta","year":"1991"},{"issue":"1","key":"10.1016\/j.jcss.2006.09.004_bib018","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1137\/S0097539792240467","article-title":"Threshold computation and cryptographic security","volume":"26","author":"Han","year":"1997","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.jcss.2006.09.004_bib019","doi-asserted-by":"crossref","unstructured":"U. Hertrampf, C. Lautemann, T. Schwentick, H. Vollmer, K.W. Wagner, On the power of polynomial time bit-reductions, in: Proceedings 8th Structure in Complexity Theory, 1993, pp. 200\u2013207","DOI":"10.1109\/SCT.1993.336526"},{"key":"10.1016\/j.jcss.2006.09.004_bib020","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1051\/ita\/1983170403211","article-title":"A semigroup characterization of dot-depth one languages","volume":"17","author":"Knast","year":"1983","journal-title":"RAIRO Inform. Theor."},{"key":"10.1016\/j.jcss.2006.09.004_bib021","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/S0304-3975(99)00278-9","article-title":"Programs over semigroups of dot-depth one","volume":"245","author":"Maciel","year":"2000","journal-title":"Theoret. Comput. Sci."},{"year":"1971","series-title":"Counterfree Automata","author":"McNaughton","key":"10.1016\/j.jcss.2006.09.004_bib022"},{"issue":"1\u20132","key":"10.1016\/j.jcss.2006.09.004_bib023","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/S0304-3975(97)00005-4","article-title":"Unambiguous computations and locally definable acceptance types","volume":"194","author":"Niedermeier","year":"1998","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.jcss.2006.09.004_bib024","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0022-0000(93)90006-I","article-title":"A complexity theory of feasible closure properties","volume":"46","author":"Ogiwara","year":"1993","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/j.jcss.2006.09.004_bib025","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/S0304-3975(96)00297-6","article-title":"Finite semigroup varieties defined by programs","volume":"180","author":"P\u00e9ladeau","year":"1997","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.jcss.2006.09.004_bib026","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/0022-0000(86)90037-1","article-title":"First-order logic and star-free sets","volume":"32","author":"Perrin","year":"1986","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/j.jcss.2006.09.004_bib027","first-page":"80","article-title":"A variety theorem without complementation","volume":"39","author":"Pin","year":"1995","journal-title":"Izv. Vyssh. Uchebn. Zaved. Mat."},{"key":"10.1016\/j.jcss.2006.09.004_bib028","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1051\/ita:2005014","article-title":"Some results on C-varieties","volume":"39","author":"Pin","year":"2005","journal-title":"Theoret. Inform. Appl."},{"key":"10.1016\/j.jcss.2006.09.004_bib029","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/BF02679467","article-title":"Polynomial closure and unambiguous product","volume":"30","author":"Pin","year":"1997","journal-title":"Theory Comput. Syst."},{"key":"10.1016\/j.jcss.2006.09.004_bib030","doi-asserted-by":"crossref","first-page":"5677","DOI":"10.1081\/AGB-120016005","article-title":"The wreath product principle for ordered semigroups","volume":"30","author":"Pin","year":"2002","journal-title":"Comm. Algebra"},{"key":"10.1016\/j.jcss.2006.09.004_bib031","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1016\/S0019-9958(65)90108-7","article-title":"On finite monoids having only trivial subgroups","volume":"8","author":"Sch\u00fctzenberger","year":"1965","journal-title":"Inform. Control"},{"issue":"2\u20133","key":"10.1016\/j.jcss.2006.09.004_bib032","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1016\/j.tcs.2005.07.020","article-title":"A reducibility for the dot-depth hierarchy","volume":"345","author":"Selivanov","year":"2005","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.jcss.2006.09.004_bib033","series-title":"Proceedings 15th International Conference on Fundamentals of Computation Theory","first-page":"125","article-title":"On the power of unambiguity in alternating machines","volume":"vol. 3623","author":"Spakowski","year":"2005"},{"key":"10.1016\/j.jcss.2006.09.004_bib034","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0022-4049(85)90062-3","article-title":"Finite semigroups varieties of the form V\u2217D","volume":"36","author":"Straubing","year":"1985","journal-title":"J. Pure Appl. Algebra"},{"key":"10.1016\/j.jcss.2006.09.004_bib035","series-title":"Formal Properties of Finite Automata and Applications","first-page":"15","article-title":"The wreath product and its applications","volume":"vol. 386","author":"Straubing","year":"1989"},{"issue":"2","key":"10.1016\/j.jcss.2006.09.004_bib036","doi-asserted-by":"crossref","first-page":"11","DOI":"10.24033\/msmf.309","article-title":"An application of the Ehrenfeucht\u2013Fra\u00efss\u00e9 game in formal language theory","volume":"16","author":"Thomas","year":"1984","journal-title":"Soc. Math. France M\u00e9m."},{"key":"10.1016\/j.jcss.2006.09.004_bib037","first-page":"51","article-title":"Relativizable and non-relativizable theorems in the polynomial theory of algorithms","volume":"57","author":"Vereshchagin","year":"1993","journal-title":"Izv. Ross. Akad. Nauk"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000006001024?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000006001024?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T17:31:27Z","timestamp":1736616687000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000006001024"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,2]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,2]]}},"alternative-id":["S0022000006001024"],"URL":"https:\/\/doi.org\/10.1016\/j.jcss.2006.09.004","relation":{},"ISSN":["0022-0000"],"issn-type":[{"type":"print","value":"0022-0000"}],"subject":[],"published":{"date-parts":[[2007,2]]}}}