{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T17:36:22Z","timestamp":1725730582483},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387708"},{"type":"electronic","value":"9783642387715"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38771-5_4","type":"book-chapter","created":{"date-parts":[[2013,6,10]],"date-time":"2013-06-10T02:16:25Z","timestamp":1370830585000},"page":"29-30","source":"Crossref","is-referenced-by-count":0,"title":["Unambiguous Finite Automata"],"prefix":"10.1007","author":[{"given":"Christof","family":"L\u00f6ding","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A.V. Aho","year":"1974","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, New York (1974)"},{"key":"4_CR2","unstructured":"Bilkowski, M.: Ambiguity property for complements of deterministic tree languages. Presentation at the Annual Workshop of the ESF Networking Programme on Games for Design and Verification, Oxford (2010)"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-642-13089-2_10","volume-title":"Language and Automata Theory and Applications","author":"N. Bousquet","year":"2010","unstructured":"Bousquet, N., L\u00f6ding, C.: Equivalence and inclusion problem for strongly unambiguous B\u00fcchi automata. In: Dediu, A.-H., Fernau, H., Mart\u00edn-Vide, C. (eds.) LATA 2010. LNCS, vol.\u00a06031, pp. 118\u2013129. Springer, Heidelberg (2010)"},{"issue":"4","key":"4_CR4","doi-asserted-by":"publisher","first-page":"662","DOI":"10.2478\/s11533-010-0046-z","volume":"8","author":"A. Carayol","year":"2010","unstructured":"Carayol, A., L\u00f6ding, C., Niwi\u0144ski, D., Walukiewicz, I.: Choice functions and well-orderings over the infinite binary tree. Central European Journal of Mathematics\u00a08(4), 662\u2013682 (2010)","journal-title":"Central European Journal of Mathematics"},{"issue":"1\u20133","key":"4_CR5","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/S0304-3975(02)00618-7","volume":"297","author":"O. Carton","year":"2003","unstructured":"Carton, O., Michel, M.: Unambiguous B\u00fcchi automata. Theor. Comput. Sci.\u00a0297(1\u20133), 37\u201381 (2003)","journal-title":"Theor. Comput. Sci."},{"issue":"14-15","key":"4_CR6","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1016\/j.ipl.2012.04.010","volume":"112","author":"D. Isaak","year":"2012","unstructured":"Isaak, D., L\u00f6ding, C.: Efficient inclusion testing for simple classes of unambiguous \u03c9-automata. Information Processing Letters\u00a0112(14-15), 578\u2013582 (2012)","journal-title":"Information Processing Letters"},{"issue":"4","key":"4_CR7","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1016\/j.jcss.2006.10.021","volume":"73","author":"W. Martens","year":"2007","unstructured":"Martens, W., Niehren, J.: On the minimization of xml schemas and tree automata for unranked trees. J. Comput. Syst. Sci.\u00a073(4), 550\u2013583 (2007)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"4_CR8","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1137\/0219027","volume":"19","author":"H. Seidl","year":"1990","unstructured":"Seidl, H.: Deciding equivalence of finite tree automata. SIAM J. Comput.\u00a019(3), 424\u2013437 (1990)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"4_CR9","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1137\/0214044","volume":"14","author":"R.E. Stearns","year":"1985","unstructured":"Stearns, R.E., Hunt III, H.B.: On the equivalence and containment problems for unambiguous regular expressions, regular grammars and finite automata. SIAM Journal on Computing\u00a014(3), 598\u2013611 (1985)","journal-title":"SIAM Journal on Computing"}],"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-38771-5_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T00:29:44Z","timestamp":1557793784000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38771-5_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387708","9783642387715"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38771-5_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}