{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,16]],"date-time":"2025-07-16T13:52:44Z","timestamp":1752673964730},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,7,6]],"date-time":"2007-07-06T00:00:00Z","timestamp":1183680000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2008,2]]},"DOI":"10.1007\/s00224-007-9002-0","type":"journal-article","created":{"date-parts":[[2007,7,5]],"date-time":"2007-07-05T17:46:49Z","timestamp":1183657609000},"page":"256-286","source":"Crossref","is-referenced-by-count":14,"title":["Languages of Dot-Depth 3\/2"],"prefix":"10.1007","volume":"42","author":[{"given":"Christian","family":"Gla\u00dfer","sequence":"first","affiliation":[]},{"given":"Heinz","family":"Schmitz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,7,6]]},"reference":[{"key":"9002_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1007\/BFb0039607","volume-title":"Proceedings 4th Symposium on Theoretical Aspects of Computer Science","author":"M. Arfi","year":"1987","unstructured":"Arfi, M.: Polynomial operations on rational languages. In: Proceedings 4th Symposium on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science, vol. 247, pp. 198\u2013206. Springer, New York (1987)"},{"key":"9002_CR2","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 91, 71\u201384 (1991)","journal-title":"Theor. Comput. Sci."},{"key":"9002_CR3","doi-asserted-by":"crossref","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. J. Comput. Syst. Sci. 16, 37\u201355 (1978)","journal-title":"J. Comput. Syst. Sci."},{"key":"9002_CR4","doi-asserted-by":"crossref","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. J. Comput. Syst. Sci. 5, 1\u201316 (1971)","journal-title":"J. Comput. Syst. Sci."},{"key":"9002_CR5","volume-title":"Automata, Languages and Machines, vol. B","author":"S. Eilenberg","year":"1976","unstructured":"Eilenberg, S.: Automata, Languages and Machines, vol. B. Academic, New York (1976)"},{"key":"9002_CR6","unstructured":"Gla\u00dfer, C.: A normal form for classes of concatenation hierarchies. Technical Report\u00a0216, Inst. f\u00fcr Informatik, Univ. W\u00fcrzburg (1998)"},{"key":"9002_CR7","series-title":"Lecture Notes in Computer Science","first-page":"503","volume-title":"Proceedings 20th Conference on the Foundations of Software Technology and Theoretical Computer Science","author":"C. Gla\u00dfer","year":"2000","unstructured":"Gla\u00dfer, C., Schmitz, H.: Decidable hierarchies of starfree languages. In: Proceedings 20th Conference on the Foundations of Software Technology and Theoretical Computer Science. Lecture Notes in Computer Science, vol. 1974, pp. 503\u2013515. Springer, New York (2000)"},{"key":"9002_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1007\/3-540-46541-3_46","volume-title":"Proceedings 17th Symposium on Theoretical Aspects of Computer Science","author":"C. Gla\u00dfer","year":"2000","unstructured":"Gla\u00dfer, C., Schmitz, H.: Languages of dot-depth 3\/2. In: Proceedings 17th Symposium on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science, vol. 1770, pp. 555\u2013566. Springer, New York (2000)"},{"key":"9002_CR9","series-title":"Lecture Notes in Computer Science","first-page":"251","volume-title":"Proceedings 5th International Conference on Developments in Language Theory","author":"C. Gla\u00dfer","year":"2001","unstructured":"Gla\u00dfer, C., Schmitz, H.: Level 5\/2 of the Straubing-Th\u00e9rien-hierarchy for two-letter alphabets. In: Proceedings 5th International Conference on Developments in Language Theory. Lecture Notes in Computer Science, vol. 2295, pp. 251\u2013261. Springer, New York (2001)"},{"key":"9002_CR10","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1137\/0217058","volume":"17","author":"N. Immerman","year":"1988","unstructured":"Immerman, N.: Nondeterministic space is closed under complementation. SIAM J. Comput. 17, 935\u2013938 (1988)","journal-title":"SIAM J. Comput."},{"key":"9002_CR11","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1007\/BF01761708","volume":"8","author":"R. McNaughton","year":"1974","unstructured":"McNaughton, R.: Algebraic decision procedures for local testablility. Math. Syst. Theor. 8, 60\u201376 (1974)","journal-title":"Math. Syst. Theor."},{"key":"9002_CR12","volume-title":"Counterfree Automata","author":"R. McNaughton","year":"1971","unstructured":"McNaughton, R., Papert, S.: Counterfree Automata. MIT Press, Cambridge (1971)"},{"key":"9002_CR13","first-page":"679","volume-title":"Handbook of Formal Languages","author":"J.-E. Pin","year":"1996","unstructured":"Pin, J.-E.: Syntactic semigroups. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a0I, pp. 679\u2013746. Springer, New York (1996)"},{"key":"9002_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1007\/BFb0055073","volume-title":"Proceedings 25th International Colloquium on Automata, Languages and Programming","author":"J.-E. Pin","year":"1998","unstructured":"Pin, J.-E.: Bridges for concatenation hierarchies. In: Proceedings 25th International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science, vol. 1443, pp. 431\u2013442. Springer, New York (1998)"},{"key":"9002_CR15","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 Comput. Syst. 30, 383\u2013422 (1997)","journal-title":"Theory Comput. Syst."},{"key":"9002_CR16","doi-asserted-by":"crossref","first-page":"5677","DOI":"10.1081\/AGB-120016005","volume":"30","author":"J.E. Pin","year":"2002","unstructured":"Pin, J.E., Weil, P.: The wreath product principle for ordered semigroups. Commun. Algebra 30, 5677\u20135713 (2002)","journal-title":"Commun. Algebra"},{"key":"9002_CR17","doi-asserted-by":"crossref","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. Inf. Control 8, 190\u2013194 (1965)","journal-title":"Inf. Control"},{"key":"9002_CR18","unstructured":"Simon, I.: Hierarchies of events with dot-depth one. Ph.D. thesis, University of Waterloo (1972)"},{"key":"9002_CR19","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0304-3975(81)90036-0","volume":"13","author":"H. Straubing","year":"1981","unstructured":"Straubing, H.: A generalization of the Sch\u00fctzenberger product of finite monoids. Theor. Comput. Sci. 13, 137\u2013150 (1981)","journal-title":"Theor. Comput. Sci."},{"key":"9002_CR20","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0022-4049(85)90062-3","volume":"36","author":"H. Straubing","year":"1985","unstructured":"Straubing, H.: Finite semigroup varieties of the form V*D. J. Pure Appl. Algebra 36, 53\u201394 (1985)","journal-title":"J. Pure Appl. Algebra"},{"key":"9002_CR21","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1016\/0304-3975(88)90034-5","volume":"58","author":"H. Straubing","year":"1988","unstructured":"Straubing, H.: Semigroups and languages of dot-depth two. Theor. Comput. Sci. 58, 361\u2013378 (1988)","journal-title":"Theor. Comput. Sci."},{"key":"9002_CR22","first-page":"96","volume":"33","author":"R. Szelepcs\u00e9nyi","year":"1987","unstructured":"Szelepcs\u00e9nyi, R.: The method of forcing for nondeterministic automata. Bull. EATCS 33, 96\u2013100 (1987)","journal-title":"Bull. EATCS"},{"key":"9002_CR23","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0304-3975(81)90057-8","volume":"14","author":"D. Th\u00e9rien","year":"1981","unstructured":"Th\u00e9rien, D.: Classification of finite monoids: the language approach. Theor. Comput. Sci. 14, 195\u2013208 (1981)","journal-title":"Theor. Comput. Sci."},{"key":"9002_CR24","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1016\/0022-0000(82)90016-2","volume":"25","author":"W. Thomas","year":"1982","unstructured":"Thomas, W.: Classifying regular events in symbolic logic. J. Comput. Syst. Sci. 25, 360\u2013376 (1982)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"9002_CR25","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. Soc. Math. France M\u00e9m. 16(2), 11\u201321 (1984)","journal-title":"Soc. Math. France M\u00e9m."},{"key":"9002_CR26","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings International Conference on Machines, Computations, and Universality","author":"K.W. Wagner","year":"2004","unstructured":"Wagner, K.W.: Leaf language classes. In: Proceedings International Conference on Machines, Computations, and Universality. Lecture Notes in Computer Science, vol. 3354. Springer, New York (2004)"},{"key":"9002_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/978-3-540-28629-5_8","volume-title":"Proceedings 29th Mathematical Foundations of Computer Science","author":"P. Weil","year":"2004","unstructured":"Weil, P.: Algebraic recognizability of languages. In: Proceedings 29th Mathematical Foundations of Computer Science. Lecture Notes in Computer Science, vol. 3153, pp. 149\u2013175. Springer, New York (2004)"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-007-9002-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-007-9002-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-007-9002-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T11:51:33Z","timestamp":1558698693000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-007-9002-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,7,6]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,2]]}},"alternative-id":["9002"],"URL":"https:\/\/doi.org\/10.1007\/s00224-007-9002-0","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,7,6]]}}}