{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:54:28Z","timestamp":1725663268852},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540514985"},{"type":"electronic","value":"9783540481805"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51498-8_38","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:02:06Z","timestamp":1330203726000},"page":"395-404","source":"Crossref","is-referenced-by-count":2,"title":["On the finite degree of ambiguity of finite tree automata"],"prefix":"10.1007","author":[{"given":"Helmut","family":"Seidl","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"key":"38_CR1","unstructured":"A.V. Aho, J.E. Hopcroft, J.D. Ullman: The design and analysis of computer algorithms. Addison-Wesley 1974"},{"key":"38_CR2","unstructured":"G. Baron: Estimates for bounded automata. Technische Universitaet Graz und oesterreichische Computer Gesellschaft, Report 253, part 2, June 1988"},{"key":"38_CR3","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/0304-3975(78)90039-7","volume":"7","author":"B. Courcelle","year":"1978","unstructured":"B. Courcelle: A representation of trees by languages, part II. Theor. Comp. Sci. 7 (1978) pp. 25\u201355","journal-title":"Theor. Comp. Sci."},{"key":"38_CR4","volume-title":"Tree automata","author":"F. Gecseg","year":"1984","unstructured":"F. Gecseg, M. Steinby: Tree automata. Akademiai Kiado, Budapest, 1984"},{"key":"38_CR5","unstructured":"W. Kuich: Finite automata and ambiguity. Technische Universitaet Graz und oesterreichische Computer Gesellschaft, Report 253, part 1, June 1988"},{"key":"38_CR6","unstructured":"W. Paul: Komplexitaetstheorie. B.G. Teubner Verlag Stuttgart 1978"},{"key":"38_CR7","doi-asserted-by":"crossref","unstructured":"H. Seidl: Deciding equivalence of finite tree automata. Proc. STACS'89, LNCS 349, pp. 480\u2013492","DOI":"10.1007\/BFb0029009"},{"key":"38_CR8","unstructured":"R. Stearns, H. Hunt III: On the equivalence and containment problems for unambiguous regular expressions, regular grammars and finite automata. 22th FOCS (1981) pp. 74\u201381"},{"key":"38_CR9","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1137\/0214044","volume":"14","author":"R. Stearns","year":"1985","unstructured":"R. Stearns, H. Hunt III: On the equivalence and containment problems for unambiguous regular expressions, regular grammars and finite automata. SIAM J. Comp. 14 (1985) pp. 598\u2013611","journal-title":"SIAM J. Comp."},{"key":"38_CR10","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1007\/BFb0016289","volume":"233","author":"A. Weber","year":"1986","unstructured":"A. Weber, H. Seidl: On the degree of ambiguity of finite automata. MFCS 1986, Lect. Notes in Comp. Sci. 233, pp. 620\u2013629","journal-title":"Lect. Notes in Comp. Sci."},{"key":"38_CR11","unstructured":"A. Weber, H. Seidl: On finitely generated monoids of matrices with entries in N. Preprint 1988"},{"key":"38_CR12","unstructured":"A. Weber: Ueber die Mehrdeutigkeit und Wertigkeit von endlichen Automaten und Transducern. Doct. Thesis Frankfurt\/Main 1987"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51498-8_38.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:03:39Z","timestamp":1619571819000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51498-8_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540514985","9783540481805"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-51498-8_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}