{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:28:41Z","timestamp":1725460121269},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642316050"},{"type":"electronic","value":"9783642316067"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31606-7_18","type":"book-chapter","created":{"date-parts":[[2012,8,25]],"date-time":"2012-08-25T07:47:55Z","timestamp":1345880875000},"page":"205-216","source":"Crossref","is-referenced-by-count":1,"title":["Regular Ideal Languages and Their Boolean Combinations"],"prefix":"10.1007","author":[{"given":"Franz","family":"Jahn","sequence":"first","affiliation":[]},{"given":"Manfred","family":"Kufleitner","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Lauser","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/11753728_5","volume-title":"Computer Science \u2013 Theory and Applications","author":"S.V. Avgustinovich","year":"2006","unstructured":"Avgustinovich, S.V., Frid, A.E.: Canonical Decomposition of a Regular Factorial Language. In: Grigoriev, D., Harrison, J., Hirsch, E.A. (eds.) CSR 2006. LNCS, vol.\u00a03967, pp. 18\u201322. Springer, Heidelberg (2006)"},{"issue":"1","key":"18_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(91)90258-4","volume":"84","author":"D. Beauquier","year":"1991","unstructured":"Beauquier, D., Pin, J.-\u00c9.: Languages and scanners. Theor. Comput. Sci.\u00a084(1), 3\u201321 (1991)","journal-title":"Theor. Comput. Sci."},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/978-3-642-14455-4_15","volume-title":"Developments in Language Theory","author":"L. Dartois","year":"2010","unstructured":"Dartois, L., Kufleitner, M., Lauser, A.: Rankers over Infinite Words. In: Gao, Y., Lu, H., Seki, S., Yu, S. (eds.) DLT 2010. LNCS, vol.\u00a06224, pp. 148\u2013159. Springer, Heidelberg (2010)"},{"issue":"3","key":"18_CR4","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1142\/S0129054108005802","volume":"19","author":"V. Diekert","year":"2008","unstructured":"Diekert, V., Gastin, P., Kufleitner, M.: A survey on small fragments of first-order logic over finite words. Int. J. Found. Comput. Sci.\u00a019(3), 513\u2013548 (2008)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/s00224-010-9266-7","volume":"48","author":"V. Diekert","year":"2011","unstructured":"Diekert, V., Kufleitner, M.: Fragments of first-order logic over infinite words. Theory Comput. Syst.\u00a048, 486\u2013516 (2011)","journal-title":"Theory Comput. Syst."},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-540-70583-3_21","volume-title":"Automata, Languages and Programming","author":"M. Gehrke","year":"2008","unstructured":"Gehrke, M., Grigorieff, S., Pin, J.-\u00c9.: Duality and Equational Theory of Regular Languages. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol.\u00a05126, pp. 246\u2013257. Springer, Heidelberg (2008)"},{"key":"18_CR7","unstructured":"Kufleitner, M., Lauser, A.: Around dot-depth one. In: D\u00f6m\u00f6si, P., Iv\u00e1n, S. (eds.) AFL 2011, pp. 255\u2013269 (2011)"},{"issue":"8","key":"18_CR8","doi-asserted-by":"publisher","first-page":"1861","DOI":"10.1142\/S0129054111009082","volume":"22","author":"M. Kufleitner","year":"2011","unstructured":"Kufleitner, M., Lauser, A.: Partially ordered two-way B\u00fcchi automata. Int. J. Found. Comput. Sci.\u00a022(8), 1861\u20131876 (2011)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"18_CR9","unstructured":"McNaughton, R., Papert, S.: Counter-Free Automata. The MIT Press (1971)"},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/3-540-16761-7_77","volume-title":"Automata, Languages and Programming","author":"D.E. Muller","year":"1986","unstructured":"Muller, D.E., Saoudi, A., Schupp, P.E.: Alternating Automata, the Weak Monadic Theory of the Tree, and its Complexity. In: Kott, L. (ed.) ICALP 1986. LNCS, vol.\u00a0226, pp. 275\u2013283. Springer, Heidelberg (1986)"},{"issue":"3","key":"18_CR11","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1145\/321281.321292","volume":"12","author":"A. Paz","year":"1965","unstructured":"Paz, A., Peleg, B.: Ultimate-definite and symmetric-definite events and automata. J. Assoc. Comput. Mach.\u00a012(3), 399\u2013410 (1965)","journal-title":"J. Assoc. Comput. Mach."},{"key":"18_CR12","unstructured":"Perrin, D., Pin, J.-\u00c9.: Infinite words. Pure and Applied Mathematics, vol.\u00a0141. Elsevier (2004)"},{"issue":"4","key":"18_CR13","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/BF02679467","volume":"30","author":"J.-\u00c9. Pin","year":"1997","unstructured":"Pin, J.-\u00c9., Weil, P.: Polynomial closure and unambiguous product. Theory Comput. Syst.\u00a030(4), 383\u2013422 (1997)","journal-title":"Theory Comput. Syst."},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/3-540-46011-X_20","volume-title":"Developments in Language Theory","author":"T. Schwentick","year":"2002","unstructured":"Schwentick, T., 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.\u00a02295, pp. 239\u2013250. Springer, Heidelberg (2002)"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Staiger, L.: \u03c9-languages. In: Salomaa, A., Rozenberg, G. (eds.) Handbook of Formal Languages, vol.\u00a03, pp. 339\u2013387. Springer (1997)","DOI":"10.1007\/978-3-642-59126-6_6"},{"issue":"7","key":"18_CR16","first-page":"379","volume":"10","author":"L. Staiger","year":"1974","unstructured":"Staiger, L., Wagner, K.W.: Automatentheoretische und automatenfreie Charakterisierungen topologischer Klassen regul\u00e4rer Folgenmengen. Elektron. Inform.-verarb. Kybernetik\u00a010(7), 379\u2013392 (1974)","journal-title":"Elektron. Inform.-verarb. Kybernetik"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"Tesson, P., Th\u00e9rien, D.: Diamonds are forever: The variety DA. In: Gomes, G., et al. (eds.) Semigroups, Algorithms, Automata and Languages 2001, pp. 475\u2013500. World\u00a0Scientific (2002)","DOI":"10.1142\/9789812776884_0021"},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"Thomas, W.: Automata on infinite objects. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, ch. 4, pp. 133\u2013191. Elsevier (1990)","DOI":"10.1016\/B978-0-444-88074-1.50009-3"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31606-7_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:39:57Z","timestamp":1620128397000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31606-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642316050","9783642316067"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31606-7_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}