Weighted finite automata over strong bimonoids

Information Sciences

Volumn 180, Issue 1, 2010, Pages 156-166

  Droste, Manfred ^a   Stüber, Torsten ^b   Vogler, Heiko ^b  

^a UNIVERSITY OF LEIPZIG   (Germany)

^b DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Bimonoids; Determinizability; Formal power series; Multi valued automata; Weighted automata

Indexed keywords

BIMONOIDS; DETERMINIZABILITY; FORMAL POWER SERIES; MULTI-VALUED AUTOMATA; WEIGHTED AUTOMATA;

TRANSLATION (LANGUAGES);

ROBOTS;

EID: 70350572364     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2009.09.003     Document Type: Article

References (34)

1. Albert J., and Kari J. Digital image compression. In: Droste M., Kuich W., and Vogler H. (Eds). Handbook of Weighted Automata (2009), Springer-Verlag (Chapter 11)
2. Baier Chr., Ciesinsky F., and Grösser M. Model checking of distributed randomized systems. In: Droste M., Kuich W., and Vogler H. (Eds). Handbook of Weighted Automata (2009), Springer-Verlag (Chapter 13)
3. Bělohlávek R. Determinism and fuzzy automata. Inform. Sci. 143 (2002) 205-209
4. R. Bělohlávek, Personal Communication, 2008.
5. Berstel J., and Reutenauer Ch. Rational series and their languages. EATCS-Monographs vol. 12 (1988), Springer-Verlag
6. Borchardt B., Maletti A., Šešelja B., Tepavčevic A., and Vogler H. Cut sets as recognizable tree languages. Fuzzy Sets Syst. 157 (2006) 1560-1571
7. Buchsbaum A.L., Giancarlo R., and Westbrook J.R. On the determinization of weighted finite automata. SIAM J. Comput. 30 5 (2000) 1502-1531
8. Culik K., and Kari J. Image compression using weighted finite automata. Comput. Graph. 17 (1993) 305-313
9. Droste M., and Gastin P. Weighted automata and weighted logics. Theor. Comput. Sci. 380 1-2 (2007) 69-86
10. In: Droste M., Kuich W., and Vogler H. (Eds). Handbook of Weighted Automata. EATCS Monographs in Theoretical Computer Science (2009), Springer-Verlag
11. S. Eilenberg, Automata, Languages, and Machines - Volume A, volume 59 of Pure and Applied Mathematics, Academic Press, 1974.
12. M. Eramian, Image texture analysis using weighted finite automata. Ph.D. Thesis, University of Western Ontario, London, Ontario, 2002.
13. Fülöp Z., and Vogler H. Weighted tree automata and tree transducers. In: Droste M., Kuich W., and Vogler H. (Eds). Handbook of Weighted Automata (2009), Springer-Verlag (Chapter 9)
14. Grätzer G. General Lattice Theory. second ed. (1979), Birkhäuser Verlag
15. U. Hafner, Low Bit-Rate Image and Video Coding with Weighted Finite Automata, Ph.D. Thesis, Universität Würzburg, Germany, 1999.
16. Ignjatović J., Ćirić M., and Bogdanović S. Determinization of fuzzy automata with membership values in complete residuated lattices. Inform. Sci. 178 (2008) 164-180
17. F. Katritzke, Refinements of data compression using weighted finite automata, Ph.D. Thesis, Siegen University, 2001.
18. Klir G.J., and Yuan B. Fuzzy Sets and Fuzzy Logic, Theory and Application (1995), Prentice-Hall, Englewood Cliffs, NJ
19. Knight K., and May J. Applications of weighted automata in natural language processing. In: Droste M., Kuich W., and Vogler H. (Eds). Handbook of Weighted Automata (2009), Springer-Verlag (Chapter 14)
20. K.V. Krishna, Near-Semirings: Theory and Applications, Ph.D. Thesis, IIT Delhi, New Delhi, India, 2005.
21. W. Kuich, A. Salomaa, Semirings, Automata, Languages, vol. 5, Monogr. Theoret. Comput. Sci. EATCS Ser., Springer-Verlag, 1986.
22. T. Lengauer, D. Theune, Unstructured Path Problems and the Making of Semirings, in: Algorithms and Data Structures, Proceedings WADS'91, Ottawa, Canada, Number 519 in Lecture Notes in Comput. Sci., 1991, pp. 189-200.
23. Li Y. Approximation and robustness of fuzzy finite automata. Int. J. Approx. Reason. 47 (2008) 247-257
24. Li Y., and Pedrycz W. Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids. Fuzzy Sets Syst. 156 (2005) 68-92
25. Li Y., and Pedrycz W. Minimization of lattice finite automata and its application to the decomposition of lattice languages. Fuzzy Sets Syst. 158 (2007) 1423-1436
26. Mohri M. Finite-state transducers in language and speech processing. Comput. Linguist. 23 2 (1997) 269-311
27. Mohri M. Minimization algorithms for sequential transducers. Theor. Comput. Sci. 234 (2000) 177-201
28. Mohri M., Pereira F., and Riley M. The design principles of a weighted finite-state transducer library. Theor. Comput. Sci. 231 (2000) 17-32
29. Sakarovitch J. Éléments de Théorie des Automates (2003), Vuibert
30. Salomaa A., and Soittola M. Automata-Theoretic Aspects of Formal Power Series. Texts and Monographs in Computer Science (1978), Springer-Verlag
31. Schützenberger M.P. On the definition of a family of automata. Inform. Control 4 (1961) 245-270
32. Šešelja B., Tepavčević A., and Vogler H. A note on cut-worthiness of recognizable tree series. Fuzzy Sets Syst. 159 22 (2008) 3087-3090
33. van Hoorn W.G., and van Oozelaa B. Fundamental notions in the theory of seminearrings. Compos. Math. 18 (1967) 65-78
34. Wechler W. The Concept of Fuzziness in Automata and Language Theory. Studien zur Algebra und ihre Anwendungen. 5 ed. (1978), Akademie-Verlag, Berlin