{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:48:13Z","timestamp":1725486493497},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540434535"},{"type":"electronic","value":"9783540460114"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-46011-x_21","type":"book-chapter","created":{"date-parts":[[2007,6,18]],"date-time":"2007-06-18T22:54:16Z","timestamp":1182207256000},"page":"251-261","source":"Crossref","is-referenced-by-count":2,"title":["Level 5\/2 of the Straubing-Th\u00e9rien Hierarchy for Two-Letter Alphabets"],"prefix":"10.1007","author":[{"given":"Christian","family":"Gla\u00dfer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Heinz","family":"Schmitz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,3,19]]},"reference":[{"key":"21_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1007\/BFb0039607","volume-title":"Polynomial operations on rational languages","author":"M. Arfi","year":"1987","unstructured":"M. Arfi. Polynomial operations on rational languages. In Proceedings 4th Symposium on Theoretical Aspects of Computer Science, volume 247 of Lecture Notes in Computer Science, pages 198\u2013206. Springer-Verlag, 1987."},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0304-3975(91)90268-7","volume":"91","author":"M. Arfi","year":"1991","unstructured":"M. Arfi. Op\u00e9rations polynomiales et hi\u00e9rarchies de concat\u00e9nation. Theoretical Computer Science, 91:71\u201384, 1991.","journal-title":"Theoretical Computer Science"},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0022-0000(78)90049-1","volume":"16","author":"J. A. Brzozowski","year":"1978","unstructured":"J. A. Brzozowski and R. Knast. The dot-depth hierarchy of star-free languages is infinite. Journal of Computer and System Sciences, 16:37\u201355, 1978.","journal-title":"Journal of Computer and System Sciences"},{"key":"21_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":"R. S. Cohen and J. A. Brzozowski. Dot-depth of star-free events. Journal of Computer and System Sciences, 5:1\u201316, 1971.","journal-title":"Journal of Computer and System Sciences"},{"key":"21_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1007\/3-540-46541-3_46","volume-title":"Languages of dot-depth 3\/2","author":"C. Gla\u00dfer","year":"2000","unstructured":"C. Gla\u00dfer and H. Schmitz. Languages of dot-depth 3\/2. In Proceedings 17th Symposium on Theoretical Aspects of Computer Science, volume 1770 of Lecture Notes in Computer Science, pages 555\u2013566. Springer Verlag, 2000."},{"key":"21_CR6","series-title":"Lect Notes Comput Sci","first-page":"503","volume-title":"Decidable hierarchies of starfree languages","author":"C. Gla\u00dfer","year":"2000","unstructured":"C. Gla\u00dfer and H. Schmitz. Decidable hierarchies of starfree languages. In Proceedings 20th Conference on the Foundations of Software Technology and Theoretical Computer Science, volume 1974 of Lecture Notes in Computer Science, pages 503\u2013515. Springer Verlag, 2000."},{"key":"21_CR7","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1051\/ita\/1983170403211","volume":"17","author":"R. Knast","year":"1983","unstructured":"R. Knast. A semigroup characterization of dot-depth one languages. RAIRO Inform. Th\u00e9or., 17:321\u2013330, 1983.","journal-title":"RAIRO Inform. Th\u00e9or."},{"key":"21_CR8","volume-title":"Counterfree Automata","author":"R. McNaughton","year":"1971","unstructured":"R. McNaughton and S. Papert. Counterfree Automata. MIT Press, Cambridge, 1971."},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/0022-0000(86)90037-1","volume":"32","author":"D. Perrin","year":"1986","unstructured":"D. Perrin and J. E. Pin. First-order logic and star-free sets. Journal of Computer and System Sciences, 32:393\u2013406, 1986.","journal-title":"Journal of Computer and System Sciences"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"J. E. Pin. Syntactic semigroups. In G. Rozenberg and A. Salomaa, editors, Handbook of formal languages, volume I, pages 679\u2013746. Springer, 1996.","DOI":"10.1007\/978-3-642-59136-5_10"},{"key":"21_CR11","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/s002240000058","volume":"30","author":"J. E. Pin","year":"1997","unstructured":"J. E. Pin and P. Weil. Polynomial closure and unambiguous product. Theory of computing systems, 30:383\u2013422, 1997.","journal-title":"Theory of computing systems"},{"key":"21_CR12","unstructured":"H. Schmitz. The Forbidden-Pattern Approach to Concatenation Hierarchies. PhD thesis, Fakult\u00e4t f\u00fcr Mathematik und Informatik, Universit\u00e4tW\u00fcrzburg, 2001."},{"key":"21_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 and Control, 8:190\u2013194, 1965.","journal-title":"Information and Control"},{"key":"21_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1007\/3-540-07407-4_23","volume-title":"Piecewise testable events","author":"I. Simon","year":"1975","unstructured":"I. Simon. Piecewise testable events. In Proceedings 2nd GI Conference, volume 33 of Lecture Notes in Computer Science, pages 214\u2013222. Springer-Verlag, 1975."},{"key":"21_CR15","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/0304-3975(81)90036-0","volume":"13","author":"H. Straubing","year":"1981","unstructured":"H. Straubing. A generalization of the Sch\u00fctzenberger product of finite monoids. Theoretical Computer Science, 13:137\u2013150, 1981.","journal-title":"Theoretical Computer Science"},{"key":"21_CR16","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0022-4049(85)90062-3","volume":"36","author":"H. Straubing","year":"1985","unstructured":"H. Straubing. Finite semigroups varieties of the formV * D. J. Pure Appl. Algebra, 36:53\u201394, 1985.","journal-title":"J. Pure Appl. Algebra"},{"key":"21_CR17","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/0304-3975(88)90034-5","volume":"58","author":"H. Straubing","year":"1988","unstructured":"H. Straubing. Semigroups and languages of dot-depth two. Theoretical Computer Science, 58:361\u2013378, 1988.","journal-title":"Theoretical Computer Science"},{"key":"21_CR18","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0304-3975(81)90057-8","volume":"14","author":"D. Th\u00e9rien","year":"1981","unstructured":"D. Th\u00e9rien. Classification of finite monoids: the language approach. Theoretical Computer Science, 14:195\u2013208, 1981.","journal-title":"Theoretical Computer Science"},{"key":"21_CR19","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1016\/0022-0000(82)90016-2","volume":"25","author":"W. Thomas","year":"1982","unstructured":"W. Thomas. Classifying regular events in symbolic logic. Journal of Computer and System Sciences, 25:360\u2013376, 1982.","journal-title":"Journal of Computer and System Sciences"},{"key":"21_CR20","unstructured":"W. Thomas. Languages, automata, and logic. Technical Report 9607, Institut f\u00fcr Informatik und praktische Mathematik, Universit\u00e4t Kiel, 1996."}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46011-X_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T04:23:37Z","timestamp":1556511817000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46011-X_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540434535","9783540460114"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-46011-x_21","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}