{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T22:13:33Z","timestamp":1725747213778},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642397172"},{"type":"electronic","value":"9783642397189"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39718-9_18","type":"book-chapter","created":{"date-parts":[[2013,8,30]],"date-time":"2013-08-30T03:01:54Z","timestamp":1377831714000},"page":"301-318","source":"Crossref","is-referenced-by-count":0,"title":["Deterministic Logics for UL"],"prefix":"10.1007","author":[{"given":"Paritosh K.","family":"Pandya","sequence":"first","affiliation":[]},{"given":"Simoni S.","family":"Shah","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"18_CR1","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_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-73208-2_1","volume-title":"Developments in Language Theory","author":"V. Diekert","year":"2007","unstructured":"Diekert, V., Kufleitner, M.: On first-order fragments for words and mazurkiewicz traces. In: Harju, T., Karhum\u00e4ki, J., Lepist\u00f6, A. (eds.) DLT 2007. LNCS, vol.\u00a04588, pp. 1\u201319. Springer, Heidelberg (2007)"},{"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":"4","key":"18_CR4","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."},{"issue":"2","key":"18_CR5","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1006\/inco.2001.2953","volume":"179","author":"K. Etessami","year":"2002","unstructured":"Etessami, K., Vardi, M.Y., Wilke, T.: First-order logic with two variables and unary temporal logic. Inf. Comput.\u00a0179(2), 279\u2013295 (2002)","journal-title":"Inf. Comput."},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Lodaya, K., Pandya, P.K., Shah, S.S.: Marking the chops: an unambiguous temporal logic. In: IFIP TCS, pp. 461\u2013476 (2008)","DOI":"10.1007\/978-0-387-09680-3_31"},{"key":"18_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/978-3-642-15297-9_14","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"P.K. Pandya","year":"2010","unstructured":"Pandya, P.K., Shah, S.S.: Unambiguity in timed regular languages: Automata and logics. In: Chatterjee, K., Henzinger, T.A. (eds.) FORMATS 2010. LNCS, vol.\u00a06246, pp. 168\u2013182. Springer, Heidelberg (2010)"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Sch\u00fctzenberger, M.-P.: Sur le produit de concat\u00e9nation non ambigu. In: Semigroup Forum, pp. 47\u201375 (1976)","DOI":"10.1007\/BF02194921"},{"key":"18_CR9","unstructured":"Shah, S.S.: Unambiguity and Timed Languages:Automata, Logics, Expressiveness. PhD thesis, TIFR, Mumbai (2012) (submitted)"},{"key":"18_CR10","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_CR11","doi-asserted-by":"crossref","unstructured":"Th\u00e9rien, D., Wilke, T.: Over words, two variables are as powerful as one quantifier alternation. In: STOC, pp. 234\u2013240 (1998)","DOI":"10.1145\/276698.276749"},{"key":"18_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-540-74915-8_27","volume-title":"Computer Science Logic","author":"P. Weis","year":"2007","unstructured":"Weis, P., Immerman, N.: Structure theorem and strict alternation hierarchy for FO2 on words. In: Duparc, J., Henzinger, T.A. (eds.) CSL 2007. LNCS, vol.\u00a04646, pp. 343\u2013357. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39718-9_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T00:25:52Z","timestamp":1558052752000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39718-9_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642397172","9783642397189"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39718-9_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}