{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T20:40:34Z","timestamp":1743021634025,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319341705"},{"type":"electronic","value":"9783319341712"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-34171-2_17","type":"book-chapter","created":{"date-parts":[[2016,5,30]],"date-time":"2016-05-30T02:34:18Z","timestamp":1464575658000},"page":"237-250","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Word Problem for Omega-Terms over the Trotter-Weil Hierarchy"],"prefix":"10.1007","author":[{"given":"Manfred","family":"Kufleitner","sequence":"first","affiliation":[]},{"given":"Jan Philipp","family":"W\u00e4chter","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,5,31]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1142\/9789812776884_0001","volume-title":"Semigroups, Algorithms, Automata and Languages","author":"J Almeida","year":"2002","unstructured":"Almeida, J.: Finite semigroups: an introduction to a unified theory of pseudovarieties. In: dos Gomes Moreira da Cunha, G.M., da Silva, P.V.A., Pin, J.\u00c9. (eds.) Semigroups, Algorithms, Automata and Languages, pp. 3\u201364. World Scientific, Singapore (2002)"},{"issue":"1","key":"17_CR2","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.tcs.2006.10.019","volume":"370","author":"J Almeida","year":"2007","unstructured":"Almeida, J., Zeitoun, M.: An automata-theoretic approach to the word problem for \n                    \n                      \n                    \n                    $$\\omega $$\n                  -terms over R. Theor. Comput. Sci. 370(1), 131\u2013169 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"17_CR3","volume-title":"Automata, Languages, and Machines","author":"S Eilenberg","year":"1976","unstructured":"Eilenberg, S.: Automata, Languages, and Machines, vol. B. Academic press, New York (1976)"},{"issue":"3","key":"17_CR4","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1112\/plms\/s3-58.2.323","volume":"58","author":"J Gerhard","year":"1989","unstructured":"Gerhard, J., Petrich, M.: Varieties of bands revisited. Proc. Lond. Math. Soc. 58(3), 323\u2013350 (1989)","journal-title":"Proc. Lond. Math. Soc."},{"issue":"1","key":"17_CR5","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/s002339900032","volume":"59","author":"T Hall","year":"1999","unstructured":"Hall, T., Weil, P.: On radical congruence systems. Semigroup Forum 59(1), 56\u201373 (1999)","journal-title":"Semigroup Forum"},{"key":"17_CR6","series-title":"LIPIcs","first-page":"374","volume-title":"STACS 2014, Proceedings","author":"M Huschenbett","year":"2014","unstructured":"Huschenbett, M., Kufleitner, M.: Ehrenfeucht-fra\u00efss\u00e9 games on omega-terms. In: Mayr, E.W., Portier, N. (eds.) STACS 2014, Proceedings. LIPIcs, vol. 25, pp. 374\u2013385. Dagstuhl Publishing, Dagstuhl (2014)"},{"key":"17_CR7","first-page":"191","volume-title":"Algebraic Theory of Machines, Languages, and Semigroups","author":"K Krohn","year":"1968","unstructured":"Krohn, K., Rhodes, J.L., Tilson, B.: Homomorphisms and semilocal theory. In: Arbib, M.A. (ed.) Algebraic Theory of Machines, Languages, and Semigroups, pp. 191\u2013231. Academic Press, New York (1968). Chap. 8"},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1007\/978-3-642-32589-2_53","volume-title":"Mathematical Foundations of Computer Science 2012","author":"M Kufleitner","year":"2012","unstructured":"Kufleitner, M., Lauser, A.: The join levels of the trotter-weil hierarchy are decidable. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol. 7464, pp. 603\u2013614. Springer, Heidelberg (2012)"},{"key":"17_CR9","unstructured":"Kufleitner, M., W\u00e4chter, J.Ph.: The word problem for omega-terms over the Trotter-Weil hierarchy (2015). CoRR abs\/1509.05364"},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s00233-010-9258-6","volume":"81","author":"M Kufleitner","year":"2010","unstructured":"Kufleitner, M., Weil, P.: On the lattice of sub-pseudovarieties of DA. Semigroup Forum 81, 243\u2013254 (2010)","journal-title":"Semigroup Forum"},{"key":"17_CR11","unstructured":"Kufleitner, M., Weil, P.: The \n                    \n                      \n                    \n                    $${\\sf FO}^2$$\n                   alternation hierarchy is decidable. In: C\u00e9gielski, P., Durand, A. (eds.) Proceedings. LIPIcs, CSL 2012, vol. 16, pp. 426\u2013439. Dagstuhl Publishing, Dagstuhl (2012)"},{"issue":"3","key":"17_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/LMCS-8(3:11)2012","volume":"8","author":"M Kufleitner","year":"2012","unstructured":"Kufleitner, M., Weil, P.: On logical hierarchies within \n                    \n                      \n                    \n                    $${\\sf FO}^2$$\n                  -definable languages. Logical Methods Comput. Sci. 8(3), 1\u201330 (2012)","journal-title":"Logical Methods Comput. Sci."},{"key":"17_CR13","series-title":"IFIP International Federation for Information Processing","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/978-0-387-09680-3_31","volume-title":"Fifth Ifip International Conference On Theoretical Computer Science \u2013 TCS 2008","author":"K Lodaya","year":"2008","unstructured":"Lodaya, K., Pandya, P., Shah, S.: Marking the chops: an unambiguous temporal logic. In: Ausiello, G., Karhum\u00e4ki, J., Mauri, G., Ong, L. (eds.) IFIP TCS 2008. IFIP, pp. 461\u2013476. Springer, US (2008)"},{"issue":"5","key":"17_CR14","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1142\/S0218196701000693","volume":"11","author":"JP McCammond","year":"2001","unstructured":"McCammond, J.P.: Normal forms for free aperiodic semigroups. Int. J. Algebra Comput. 11(5), 581\u2013625 (2001)","journal-title":"Int. J. Algebra Comput."},{"key":"17_CR15","volume-title":"Counter-Free Automata","author":"R McNaughton","year":"1971","unstructured":"McNaughton, R., Papert, S.: Counter-Free Automata. The MIT Press, Cambridge (1971)"},{"issue":"46","key":"17_CR16","doi-asserted-by":"publisher","first-page":"6556","DOI":"10.1016\/j.tcs.2011.08.003","volume":"412","author":"A Moura","year":"2011","unstructured":"Moura, A.: The word problem for \n                    \n                      \n                    \n                    $$\\omega $$\n                  -terms over DA. Theor. Comput. Sci. 412(46), 6556\u20136569 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"17_CR17","volume-title":"Infinite words, Pure and Applied Mathematics","author":"D Perrin","year":"2004","unstructured":"Perrin, D., Pin, J.\u00c9.: Infinite words, Pure and Applied Mathematics, vol. 141. Elsevier, Amsterdam (2004)"},{"key":"17_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-2215-3","volume-title":"Varieties of Formal Languages","author":"J Pin","year":"1986","unstructured":"Pin, J.: Varieties of Formal Languages. North Oxford Academic Publishers Ltd, London (1986)"},{"key":"17_CR19","doi-asserted-by":"crossref","first-page":"729","DOI":"10.1007\/978-3-642-40313-2_64","volume-title":"Mathematical Foundations of Computer Science 2013","author":"Thomas Place","year":"2013","unstructured":"Place, Th., van Rooijen, L., Zeitoun, M.: Separating regular languages by piecewise testable and unambiguous languages. In: Chatterjee, K., Sgall, J. (eds.) MFCS 2013. LNCS, vol. 8087, pp. 729\u2013740. Springer, Heidelberg (2013)"},{"key":"17_CR20","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/S0019-9958(65)90108-7","volume":"8","author":"M Sch\u00fctzenberger","year":"1965","unstructured":"Sch\u00fctzenberger, M.: On finite monoids having only trivial subgroups. Inf. Control 8, 190\u2013194 (1965)","journal-title":"Inf. Control"},{"key":"17_CR21","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/3-540-46011-X_20","volume-title":"Developments in Language Theory","author":"Thomas Schwentick","year":"2002","unstructured":"Schwentick, Th., Th\u00e9rien, D., Vollmer, H.: Partially-ordered two-way automata: a new characterization of DA. In: Kuich, W., Rozenberg, G., Salomaa, A. (eds.) DLT 2001. LNCS, vol. 2295, pp. 239\u2013250. Springer, Heidelberg (2002)"},{"key":"17_CR22","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1142\/9789812776884_0021","volume-title":"Semigroups, Algorithms, Automata and Languages","author":"P Tesson","year":"2002","unstructured":"Tesson, P., Th\u00e9rien, D.: Diamonds are forever: the variety DA. In: dos Gomes Moreira da Cunha, G.M., da Silva, P.V.A., Pin, J.\u00c9. (eds.) Semigroups, Algorithms, Automata and Languages, pp. 475\u2013500. World Scientific, Singapore (2002)"},{"key":"17_CR23","doi-asserted-by":"crossref","unstructured":"Th\u00e9rien, D., Wilke, Th.: Over words, two variables are as powerful as one quantifier alternation. In: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing. pp. 234\u2013240. ACM (1998)","DOI":"10.1145\/276698.276749"},{"issue":"4","key":"17_CR24","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/s000120050033","volume":"37","author":"P Trotter","year":"1997","unstructured":"Trotter, P., Weil, P.: The lattice of pseudovarieties of idempotent semigroups and a non-regular analogue. Algebra Univers. 37(4), 491\u2013526 (1997)","journal-title":"Algebra Univers."},{"key":"17_CR25","unstructured":"van Rooijen, L., Zeitoun, M.: The separation problem for regular languages by piecewise testable languages (2013). CoRR abs\/1303.2143"},{"key":"17_CR26","unstructured":"Weis, Ph., Immerman, N.: Structure theorem and strict alternation hierarchy for \n                    \n                      \n                    \n                    $${\\sf FO}^2$$\n                   on words. Logical Methods Comput. Sci. 5(3), 1\u201323 (2009)"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-34171-2_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T15:01:36Z","timestamp":1578495696000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-34171-2_17"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319341705","9783319341712"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-34171-2_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"31 May 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}