Abstract
In this paper, we prove the equivalence of sequential, Mealy-type and Moore-type weighted finite automata with output, with respect to various semantics which are defined here.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Allauzen C, Mohri M (2004) An optimal pre-determinization algorithm for weighted transducers. Theoret Comput Sci 328:3–18
Cheng W, Mo ZW (2004) Minimization algorithm of fuzzy finite automata. Fuzzy Sets Syst 141:439–448
Lei HX, Li YM (2007) Minimization of states in automata theory based on finite lattice-ordered monoids. Inf Sci 177:1413–1421
Li YM, Pedrycz W (2006) The equivalence between fuzzy Mealy and fuzzy Moore machines. Soft Comput 10:953–959
Liu J, Moa ZW, Qiu D, Wang Y (2009) Products of Mealy-type fuzzy finite state machines. Fuzzy Sets Syst 160:2401–2415
Mohri M (2009) Weighted automata algorithms. In: Droste M, Kuich W, Vogler H (eds) Handbook of weighted automata., Monographs in theoretical computer science, an EATCS seriesSpringer, Berlin, pp 213–254
Mohri M, Pereira F, Riley M (2002) Weighted finite-state transducers in speech recognition. Comput Speech Lang 16:69–88
Mordeson JN, Nair PS (1996) Fuzzy Mealy machines. Kybernetes 25(3):18–33
Peeva K (1988) Behaviour, reduction and minimization of finite L-automata. Fuzzy Sets Syst 28:171–181
Peeva K (2004) Finite L-fuzzy machines. Fuzzy Sets Syst 141:415–437
Peeva K, Zahariev Z (2008) Computing behavior of finite fuzzy machines—algorithm and its application to reduction and minimization. Inf Sci 178:4152–4165
Petković T (2006) Congruences and homomorphisms of fuzzy automata. Fuzzy Sets Syst 157:444–458
Wu LH, Qiu DW (2010) Automata theory based on complete residuated lattice-valued logic: reduction and minimization. Fuzzy Sets Syst 161:1635–1656
Xing H, Qiu DW, Liu FC, Fan ZJ (2007) Equivalence in automata theory based on complete residuated lattice-valued logic. Fuzzy Sets Syst 158:1407–1422
Acknowledgements
The authors are very grateful to the reviewers, whose remarks and suggestions have made a significant contribution to increasing the quality of the article. Research supported by Ministry of Education, Science and Technological Development, Republic of Serbia, Grant No. 174013.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that there is no conflict of interests regarding the publication of this paper.
Additional information
Communicated by M. Droste, Z. Esik and K. Larsen.
Rights and permissions
About this article
Cite this article
Ignjatović, J., Ćirić, M. & Jančić, Z. Weighted finite automata with output. Soft Comput 22, 1121–1138 (2018). https://doi.org/10.1007/s00500-017-2493-y
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-017-2493-y