{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:37:55Z","timestamp":1725489475244},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540414131"},{"type":"electronic","value":"9783540444503"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44450-5_41","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T08:26:08Z","timestamp":1187252768000},"page":"503-515","source":"Crossref","is-referenced-by-count":0,"title":["Decidable Hierarchies of Starfree Languages"],"prefix":"10.1007","author":[{"given":"Christian","family":"Gla\\er","sequence":"first","affiliation":[]},{"given":"Heinz","family":"Schmitz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,11,24]]},"reference":[{"key":"41_CR1","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":"41_CR2","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":"41_CR3","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":"41_CR4","volume-title":"Automata, languages and machines","author":"S. Eilenberg","year":"1976","unstructured":"S. Eilenberg. Automata, languages and machines, volume B. Academic Press, New York, 1976."},{"key":"41_CR5","unstructured":"C. Gla\u00dfer. A normal form for classes of concatenation hierarchies. Technical Report 216, Inst. f\u00fcr Informatik, Univ. W\u00fcrzburg, 1998."},{"key":"41_CR6","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 STACS, volume 1770 of LNCS, pages 555\u2013566. Springer Verlag, 2000."},{"key":"41_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":"41_CR8","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":"41_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1007\/BFb0055073","volume-title":"Bridges for concatenation hierarchies","author":"J.-E. Pin","year":"1998","unstructured":"J.-E. Pin. Bridges for concatenation hierarchies. In Proceedings 25th ICALP, volume 1443 of LNCS, pages 431\u2013442. Springer Verlag, 1998."},{"key":"41_CR10","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/BF02679467","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":"41_CR11","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, volume33 of Lecture Notes in Computer Science, pages 214\u2013222. Springer-Verlag, 1975."},{"key":"41_CR12","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":"41_CR13","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 semigroup varieties of the form V * D. J.Pure Appl.Algebra, 36: 53\u201394, 1985.","journal-title":"J.Pure Appl.Algebra"},{"key":"41_CR14","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":"41_CR15","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"},{"issue":"2","key":"41_CR16","doi-asserted-by":"crossref","first-page":"11","DOI":"10.24033\/msmf.309","volume":"16","author":"W. Thomas","year":"1984","unstructured":"W. Thomas. An application of the Ehrenfeucht-Fra\u00efss\u00e9 game in formal language theory. Soci\u00e9t\u00e9 Math\u00e9matique de France, m\u00e9moire 16, 2: 11\u201321, 1984.","journal-title":"Soci\u00e9t\u00e9 Math\u00e9matique de France, m\u00e9moire"},{"key":"41_CR17","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/BF02573578","volume":"46","author":"P. Weil","year":"1993","unstructured":"P. Weil. Some results on the dot-depth hierarchy. Semigroup Forum, 46: 352\u2013370, 1993.","journal-title":"Semigroup Forum"}],"container-title":["Lecture Notes in Computer Science","FST TCS 2000: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44450-5_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T04:16:40Z","timestamp":1556770600000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44450-5_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540414131","9783540444503"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-44450-5_41","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}