{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T10:00:33Z","timestamp":1794391233304,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642223204","type":"print"},{"value":"9783642223211","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22321-1_12","type":"book-chapter","created":{"date-parts":[[2011,7,14]],"date-time":"2011-07-14T23:58:48Z","timestamp":1310687928000},"page":"129-140","source":"Crossref","is-referenced-by-count":5,"title":["Generalized One-Unambiguity"],"prefix":"10.1007","author":[{"given":"Pascal","family":"Caron","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yo-Sub","family":"Han","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ludovic","family":"Mignot","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"2","key":"12_CR1","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0020-0190(95)00199-9","volume":"57","author":"N. Blum","year":"1996","unstructured":"Blum, N.: An O(n logn) implementation of the standard method for minimizing n-state finite automata. Inform. Process. Lett.\u00a057(2), 65\u201369 (1996)","journal-title":"Inform. Process. Lett."},{"key":"12_CR2","unstructured":"Bray, T., Paoli, J., Sperberg-Mc Queen, C.M., Maler, E., Yergeau, F.: Extensible Markup Language\u00a0(XML)\u00a01.0, 4th edn. (2006), http:\/\/www.w3.org\/TR\/2006\/REC-xml-20060816"},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1006\/inco.1997.2688","volume":"140","author":"A. Br\u00fcggemann-Klein","year":"1998","unstructured":"Br\u00fcggemann-Klein, A., Wood, D.: One-unambiguous regular languages. Inform. Comput.\u00a0140, 229\u2013253 (1998)","journal-title":"Inform. Comput."},{"issue":"31-33","key":"12_CR4","doi-asserted-by":"publisher","first-page":"2987","DOI":"10.1016\/j.tcs.2010.04.036","volume":"411","author":"W. Gelade","year":"2010","unstructured":"Gelade, W.: Succinctness of regular expressions with interleaving, intersection and counting. Theor. Comput. Sci.\u00a0411(31-33), 2987\u20132998 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"12_CR5","unstructured":"Gelade, W., Neven, F.: Succinctness of the complement and intersection of regular expressions. In: Albers, S., Weil, P. (eds.) STACS. Dagstuhl Seminar Proceedings, vol.\u00a008001, pp. 325\u2013336 (2008)"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1070\/RM1961v016n05ABEH004112","volume":"16","author":"V.M. Glushkov","year":"1961","unstructured":"Glushkov, V.M.: The abstract theory of automata. Russian Mathematical Surveys\u00a016, 1\u201353 (1961)","journal-title":"Russian Mathematical Surveys"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Hopcroft, J.E.: An n log n algorithm for minimizing the states in a finite automaton. In: Kohavi, Z. (ed.) The Theory of Machines and Computations, pp. 189\u2013196. Academic Press, New York (1971)","DOI":"10.1016\/B978-0-12-417750-5.50022-1"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Kleene, S.: Representation of events in nerve nets and finite automata. In: Automata Studies, Ann. Math. Studies, vol. 34, pp. 3\u201341. Princeton U. Press (1956)","DOI":"10.1515\/9781400882618-002"},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1109\/TEC.1960.5221603","volume":"9","author":"R.F. McNaughton","year":"1960","unstructured":"McNaughton, R.F., Yamada, H.: Regular expressions and state graphs for automata. IEEE Transactions on Electronic Computers\u00a09, 39\u201357 (1960)","journal-title":"IEEE Transactions on Electronic Computers"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Moore, E.F.: Gedanken experiments on sequential machines. In: Automata Studies, pp. 129\u2013153. Princeton Univ. Press, Princeton (1956)","DOI":"10.1515\/9781400882618-006"},{"key":"12_CR11","unstructured":"Myhill, J.: Finite automata and the representation of events. WADD, TR-57-624, 112\u2013137 (1957)"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Nerode, A.: Linear automata transformation. In: Proceedings of AMS, vol.\u00a09, pp. 541\u2013544 (1958)","DOI":"10.1090\/S0002-9939-1958-0135681-9"},{"issue":"2","key":"12_CR13","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1147\/rd.32.0114","volume":"3","author":"M.O. Rabin","year":"1959","unstructured":"Rabin, M.O., Scott, D.: Finite automata and their decision problems. IBM J. Res.\u00a03(2), 115\u2013125 (1959)","journal-title":"IBM J. Res."}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22321-1_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,12]],"date-time":"2019-06-12T20:27:36Z","timestamp":1560371256000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22321-1_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642223204","9783642223211"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22321-1_12","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-642-22321-1","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}