{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,12]],"date-time":"2025-08-12T22:35:11Z","timestamp":1755038111598,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540857792"},{"type":"electronic","value":"9783540857808"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-85780-8_8","type":"book-chapter","created":{"date-parts":[[2008,9,9]],"date-time":"2008-09-09T05:23:54Z","timestamp":1220937834000},"page":"108-120","source":"Crossref","is-referenced-by-count":13,"title":["General Algorithms for Testing the Ambiguity of Finite Automata"],"prefix":"10.1007","author":[{"given":"Cyril","family":"Allauzen","sequence":"first","affiliation":[]},{"given":"Mehryar","family":"Mohri","sequence":"additional","affiliation":[]},{"given":"Ashish","family":"Rastogi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"8_CR1","first-page":"117","volume":"8","author":"C. Allauzen","year":"2003","unstructured":"Allauzen, C., Mohri, M.: Efficient Algorithms for Testing the Twins Property. Journal of Automata, Languages and Combinatorics\u00a08(2), 117\u2013144 (2003)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1007\/978-3-540-70844-5_27","volume-title":"CIAA 2008","author":"C. Allauzen","year":"2008","unstructured":"Allauzen, C., Mohri, M.: 3-way composition of weighted finite-state transducers. In: CIAA 2008. LNCS, vol.\u00a05148, pp. 262\u2013273. Springer, Heidelberg (2008)"},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0304-3975(88)90012-6","volume":"23","author":"T. Chan","year":"1983","unstructured":"Chan, T., Ibarra, O.H.: On the finite-valuedness problem for sequential machines. Theoretical Computer Science\u00a023, 95\u2013101 (1983)","journal-title":"Theoretical Computer Science"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/11682462_32","volume-title":"LATIN 2006: Theoretical Informatics","author":"C. Cortes","year":"2006","unstructured":"Cortes, C., Mohri, M., Rastogi, A., Riley, M.: Efficient computation of the relative entropy of probabilistic automata. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol.\u00a03887, pp. 323\u2013336. Springer, Heidelberg (2006)"},{"key":"8_CR5","doi-asserted-by":"crossref","DOI":"10.1002\/0471200611","volume-title":"Elements of Information Theory","author":"T.M. Cover","year":"1991","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory. John Wiley & Sons, Inc., New York (1991)"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","first-page":"171","volume-title":"STACS 86","author":"O.H. Ibarra","year":"1985","unstructured":"Ibarra, O.H., Ravikumar, B.: On sparseness, ambiguity and other decision problems for acceptors and transducers. In: Monien, B., Vidal-Naquet, G. (eds.) STACS 1986. LNCS, vol.\u00a0210, pp. 171\u2013179. Springer, Heidelberg (1985)"},{"issue":"2","key":"8_CR7","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(77)90006-8","volume":"5","author":"G. Jacob","year":"1977","unstructured":"Jacob, G.: Un algorithme calculant le cardinal, fini ou infini, des demi-groupes de matrices. Theoretical Computer Science\u00a05(2), 183\u2013202 (1977)","journal-title":"Theoretical Computer Science"},{"key":"8_CR8","unstructured":"Kuich, W.: Finite automata and ambiguity. Technical Report 253, Institute f\u00fcr Informationsverarbeitung - Technische Universit\u00e4t Graz und \u00d6CG (1988)"},{"issue":"2","key":"8_CR9","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0304-3975(77)90001-9","volume":"5","author":"A. Mandel","year":"1977","unstructured":"Mandel, A., Simon, I.: On finite semigroups of matrices. Theoretical Computer Science\u00a05(2), 101\u2013111 (1977)","journal-title":"Theoretical Computer Science"},{"key":"8_CR10","volume-title":"Proceedings of ECAI 1996, Workshop on Extended finite state models of language","author":"M. Mohri","year":"1996","unstructured":"Mohri, M., Pereira, F.C.N., Riley, M.: Weighted Automata in Text and Speech Processing. In: Proceedings of ECAI 1996, Workshop on Extended finite state models of language, Budapest, Hungary. John Wiley and Sons, Chichester (1996)"},{"key":"8_CR11","volume-title":"Finite State Language Processing","author":"F. Pereira","year":"1997","unstructured":"Pereira, F., Riley, M.: Speech Recognition by Composition of Weighted Finite Automata. In: Finite State Language Processing. MIT Press, Cambridge (1997)"},{"issue":"6","key":"8_CR12","doi-asserted-by":"publisher","first-page":"1263","DOI":"10.1137\/0218083","volume":"18","author":"B. Ravikumar","year":"1989","unstructured":"Ravikumar, B., Ibarra, O.H.: Relating the type of ambiguity of finite automata to the succintness of their representation. SIAM Journal on Computing\u00a018(6), 1263\u20131282 (1989)","journal-title":"SIAM Journal on Computing"},{"key":"8_CR13","unstructured":"Reutenauer, C.: Propri\u00e9t\u00e9s arithm\u00e9tiques et topologiques des s\u00e9ries rationnelles en variable non commutative. Th\u00e8se de troisi\u00e8me cycle, Universit\u00e9 Paris VI (1977)"},{"key":"8_CR14","unstructured":"Weber, A.: \u00dcber die Mehrdeutigkeit und Wertigkeit von endlichen, Automaten und Transducern. Dissertation, Goethe-Universit\u00e4t Frankfurt am Main (1987)"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1007\/BFb0016289","volume-title":"Mathematical Foundations of Computer Science 1986","author":"A. Weber","year":"1986","unstructured":"Weber, A., Seidl, H.: On the degree of ambiguity of finite automata. In: Wiedermann, J., Gruska, J., Rovan, B. (eds.) MFCS 1986. LNCS, vol.\u00a0233, pp. 620\u2013629. Springer, Heidelberg (1986)"},{"issue":"2","key":"8_CR16","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/0304-3975(91)90381-B","volume":"88","author":"A. Weber","year":"1991","unstructured":"Weber, A., Seidl, H.: On the degree of ambiguity of finite automata. Theoretical Computer Science\u00a088(2), 325\u2013349 (1991)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85780-8_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,18]],"date-time":"2023-02-18T00:24:08Z","timestamp":1676679848000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-85780-8_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540857792","9783540857808"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85780-8_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}