{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:10:31Z","timestamp":1725455431457},"publisher-location":"Berlin\/Heidelberg","reference-count":14,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540167838"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0016289","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T05:39:17Z","timestamp":1131860357000},"page":"620-629","source":"Crossref","is-referenced-by-count":12,"title":["On the degree of ambiguity of finite automata"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Weber","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Helmut","family":"Seidl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"60_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A. Aho","year":"1974","unstructured":"A. Aho, J. Hopcroft, J. Ullman (1974): The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass.."},{"key":"60_CR2","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0304-3975(88)90012-6","volume":"23","author":"T. Chan","year":"1983","unstructured":"T.-h. Chan, O. Ibarra (1983): On the Finite-Valuedness Problem for Sequential Machines. TCS 23, pp. 95\u2013101.","journal-title":"TCS"},{"key":"60_CR3","unstructured":"K. Culik II, J. Karhum\u00e4ki (1985): The Equivalence Problem for Single-Valued 2-Way Transducers is Decidable. Research Report, CS 85-24, University of Waterloo."},{"key":"60_CR4","doi-asserted-by":"crossref","unstructured":"K. Culik II, J. Karhum\u00e4ki (1985): The Equivalence of Finite Valued Transducers (on HDTOL Languages) is Decidable. Technical Report, University of Waterloo.","DOI":"10.1007\/BFb0016250"},{"key":"60_CR5","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1145\/321466.321473","volume":"15","author":"T. Griffiths","year":"1968","unstructured":"T. Griffiths (1968): The Unsolvability of the Equivalence Problem for \u03b5-Free Nondeterministic Generalized Machines. JACM 15, pp. 409\u2013413.","journal-title":"JACM"},{"key":"60_CR6","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BF01744569","volume":"16","author":"E. Gurari","year":"1983","unstructured":"E. Gurari, O. Ibarra (1983): A Note on Finite-Valued and Finitely Ambiguous Transducers. Math. Systems Theory 16, pp. 61\u201366.","journal-title":"Math. Systems Theory"},{"key":"60_CR7","volume-title":"Introduction to Formal Language Theory","author":"M. Harrison","year":"1978","unstructured":"M. Harrison (1978): Introduction to Formal Language Theory. Addison-Wesley, Reading, Mass.."},{"key":"60_CR8","first-page":"233","volume":"24","author":"K. Hashiguchi","year":"1982","unstructured":"K. Hashiguchi (1982): Limitedness Theorem on Finite Automata with Distance Functions. JCSS 24, pp. 233\u2013244.","journal-title":"JCSS"},{"key":"60_CR9","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"J. Hopcroft","year":"1979","unstructured":"J. Hopcroft, J. Ullman (1979): Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading, Mass.."},{"key":"60_CR10","first-page":"171","volume":"1986","author":"O. Ibarra","year":"1986","unstructured":"O. Ibarra, B. Ravikumar (1986): On Sparseness, Ambiguity and other Decision Problems for Acceptors and Transducers. STACS 1986, pp. 171\u2013179.","journal-title":"STACS"},{"key":"60_CR11","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF00263994","volume":"13","author":"C. Kintala","year":"1980","unstructured":"Ch. Kintala, D. Wotschke (1980): Amounts of Nondeterminism in Finite Automata. Acta Inf. 13, pp. 199\u2013204.","journal-title":"Acta Inf."},{"key":"60_CR12","doi-asserted-by":"crossref","first-page":"598","DOI":"10.1137\/0214044","volume":"14","author":"R. Stearns","year":"1985","unstructured":"R. Stearns, H. Hunt III (1985): On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars, and Finite Automata. SIAM J. Comp. 14, pp. 598\u2013611.","journal-title":"SIAM J. Comp."},{"key":"60_CR13","doi-asserted-by":"crossref","unstructured":"L. Stockmeyer, A. Meyer (1973): Word Problems Requiring Exponential Time (Preliminary Report). Proc. 7th ACM Symp. on Principles of Programming Languages, pp. 1\u20139.","DOI":"10.1145\/800125.804029"},{"key":"60_CR14","unstructured":"A. Weber, H. Seidl (1985): \u00dcber die Mehrdeutigkeit und Wertigkeit von endlichen Automaten und \u00dcbersetzern. Goethe-Universit\u00e4t, Ffm.."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1986"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0016289.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:36:04Z","timestamp":1607549764000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0016289"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540167838"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/bfb0016289","relation":{},"subject":[]}}