{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,18]],"date-time":"2025-01-18T05:06:28Z","timestamp":1737176788378,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540416951"},{"type":"electronic","value":"9783540446934"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44693-1_48","type":"book-chapter","created":{"date-parts":[[2007,6,12]],"date-time":"2007-06-12T05:10:18Z","timestamp":1181625018000},"page":"551-562","source":"Crossref","is-referenced-by-count":4,"title":["Regular Languages Defined by Generalized First-Order Formulas with a Bounded Number of Bound Variables"],"prefix":"10.1007","author":[{"given":"Howard","family":"Straubing","sequence":"first","affiliation":[]},{"given":"Denis","family":"Th\u00e9rien","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,3,16]]},"reference":[{"key":"48_CR1","unstructured":"A. Baziramwabo, P. McKenzie and D. Th\u00e9rien, \u201cModular Temporal Logic\u201d, Proc. 1999 IEEE Conference on Logic in Computer Science (LICS), Trento, Italy, July 1999."},{"key":"48_CR2","series-title":"Lect Notes Comput Sci","first-page":"6379","volume-title":"Proc. 16th ICALP","author":"D. Beauquier","year":"1989","unstructured":"D. Beauquier and J. E. Pin, \u201cFactors of Words\u201d;, Proc. 16th ICALP, Springer Lecture Notes in Computer Science 372 (1989) 6379."},{"key":"48_CR3","unstructured":"S. Eilenberg, Automata, Languages and Machines, vol. B, Academic Press, New York, 1976."},{"key":"48_CR4","doi-asserted-by":"crossref","unstructured":"K. Etessami, M. Vardi, and T. Wilke, \u201cFirst-Order Logic with Two Variables and Unary Temporal Logic\u201d, Proceedings, 12th IEEE Symposium on Logic in Computer Science, 228\u2013235 (1996).","DOI":"10.7146\/brics.v4i5.18784"},{"key":"48_CR5","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0890-5401(89)90055-2","volume":"83","author":"N. Immerman","year":"1989","unstructured":"N. Immerman and D. Kozen, \u201cDefinability with a Bounded Number of Bound Variables\u201d, Information and Computation, 83, 121\u2013139 (1989).","journal-title":"Information and Computation"},{"key":"48_CR6","unstructured":"J. Kamp, Tense Logic and the Theory of Linear Order, Ph. D. thesis, UCLA (1968)."},{"key":"48_CR7","volume-title":"Counter-Free Automata","author":"R. McNaughton","year":"1971","unstructured":"R. McNaughton and S. Papert, Counter-Free Automata, MIT Press, Cambridge, Massachusetts, 1971."},{"key":"48_CR8","unstructured":"S. Margolis, M. Sapir, and P. Weil, \u201cClosed Subgroups in Pro-V Topologies and the Extension Problem for Inverse Automata\u201d, preprint."},{"key":"48_CR9","doi-asserted-by":"crossref","unstructured":"J. E. Pin, Varieties of Formal Languages, Plenum, London, 1986.","DOI":"10.1007\/978-1-4613-2215-3"},{"key":"48_CR10","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, \u201cPolynomial Closure and Unambiguous Product\u201d, Theory Comput. Systems 30 (1997) 383\u2013422.","journal-title":"Theory Comput. Systems"},{"key":"48_CR11","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0022-4049(89)90137-0","volume":"62","author":"J. Rhodes","year":"1989","unstructured":"J. Rhodes and B. Tilson, \u201cThe Kernel of Monoid Morphisms\u201d, J. Pure and Applied Algebra 62 (1989) 227\u2013268.","journal-title":"J. Pure and Applied Algebra"},{"key":"48_CR12","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1142\/S021819679400004X","volume":"4","author":"L. Ribes","year":"1994","unstructured":"L. Ribes and P. Zaleskii, \u201cThe pro-p topology of a free group and algorithmic problems in semigroups\u201d, International Journal of Algebra and Computation 4 (1994) 359\u2013374.","journal-title":"International Journal of Algebra and Computation"},{"key":"48_CR13","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/0001-8708(73)90007-8","volume":"11","author":"P. Stiffler","year":"1973","unstructured":"P. Stiffler, \u201cExtensions of the Fundamental Theorem of Finite Semigroups\u201d, Advances in Mathematics, 11 159\u2013209 (1973).","journal-title":"Advances in Mathematics"},{"key":"48_CR14","doi-asserted-by":"crossref","unstructured":"H. Straubing, Finite Automata, Formal Languages, and Circuit Complexity, Birkh\u00e4user, Boston, 1994.","DOI":"10.1007\/978-1-4612-0289-9"},{"key":"48_CR15","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0022-4049(79)90024-0","volume":"15","author":"H. Straubing","year":"1979","unstructured":"H. Straubing, \u201cFamilies of recognizable sets corresponding to certain varieties of finite monoids\u201d, Journal of Pure and Applied Algebra 15 (1979), 305\u2013318.","journal-title":"Journal of Pure and Applied Algebra"},{"key":"48_CR16","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1006\/inco.1995.1067","volume":"118","author":"H. Straubing","year":"1995","unstructured":"H. Straubing, D. Th\u00e9erien, and W. Thomas, \u201cRegular Languages Defined by Generalized Quantifiers\u201d, Information and Computation 118 289\u2013301 (1995).","journal-title":"Information and Computation"},{"key":"48_CR17","doi-asserted-by":"crossref","unstructured":"D. Th\u00e9rien and T. Wilke, \u201cOver Words, Two Variables are as Powerful as One Quantifier Alternation,\u201d Proc. 30th ACM Symposium on the Theory of Computing 256\u2013263 (1998).","DOI":"10.1145\/276698.276749"},{"key":"48_CR18","doi-asserted-by":"crossref","unstructured":"T. Wilke, \u201cClassifying Discrete Temporal Properties\u201d, Habilitationsschrift, University of Kiel, 1998.","DOI":"10.1007\/3-540-49116-3_3"}],"container-title":["Lecture Notes in Computer Science","STACS 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44693-1_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T05:57:21Z","timestamp":1737093441000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44693-1_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540416951","9783540446934"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-44693-1_48","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}