Advertisement

Soft Computing

, Volume 22, Issue 4, pp 1121–1138 | Cite as

Weighted finite automata with output

  • Jelena Ignjatović
  • Miroslav Ćirić
  • Zorana Jančić
Focus

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.

Keywords

Weighted automaton Fuzzy automaton Sequential automaton Mealy-type automaton Moore-type automaton 

Notes

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.

Compliance with ethical standards

Conflict of interest

The authors declare that there is no conflict of interests regarding the publication of this paper.

References

  1. Allauzen C, Mohri M (2004) An optimal pre-determinization algorithm for weighted transducers. Theoret Comput Sci 328:3–18MathSciNetCrossRefMATHGoogle Scholar
  2. Cheng W, Mo ZW (2004) Minimization algorithm of fuzzy finite automata. Fuzzy Sets Syst 141:439–448MathSciNetCrossRefMATHGoogle Scholar
  3. Lei HX, Li YM (2007) Minimization of states in automata theory based on finite lattice-ordered monoids. Inf Sci 177:1413–1421MathSciNetCrossRefMATHGoogle Scholar
  4. Li YM, Pedrycz W (2006) The equivalence between fuzzy Mealy and fuzzy Moore machines. Soft Comput 10:953–959CrossRefMATHGoogle Scholar
  5. Liu J, Moa ZW, Qiu D, Wang Y (2009) Products of Mealy-type fuzzy finite state machines. Fuzzy Sets Syst 160:2401–2415MathSciNetCrossRefMATHGoogle Scholar
  6. 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–254CrossRefGoogle Scholar
  7. Mohri M, Pereira F, Riley M (2002) Weighted finite-state transducers in speech recognition. Comput Speech Lang 16:69–88CrossRefGoogle Scholar
  8. Mordeson JN, Nair PS (1996) Fuzzy Mealy machines. Kybernetes 25(3):18–33MathSciNetCrossRefMATHGoogle Scholar
  9. Peeva K (1988) Behaviour, reduction and minimization of finite L-automata. Fuzzy Sets Syst 28:171–181MathSciNetCrossRefMATHGoogle Scholar
  10. Peeva K (2004) Finite L-fuzzy machines. Fuzzy Sets Syst 141:415–437MathSciNetCrossRefMATHGoogle Scholar
  11. Peeva K, Zahariev Z (2008) Computing behavior of finite fuzzy machines—algorithm and its application to reduction and minimization. Inf Sci 178:4152–4165MathSciNetCrossRefMATHGoogle Scholar
  12. Petković T (2006) Congruences and homomorphisms of fuzzy automata. Fuzzy Sets Syst 157:444–458MathSciNetCrossRefMATHGoogle Scholar
  13. Wu LH, Qiu DW (2010) Automata theory based on complete residuated lattice-valued logic: reduction and minimization. Fuzzy Sets Syst 161:1635–1656MathSciNetCrossRefMATHGoogle Scholar
  14. 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–1422MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2017

Authors and Affiliations

  • Jelena Ignjatović
    • 1
  • Miroslav Ćirić
    • 1
  • Zorana Jančić
    • 1
  1. 1.Department of Mathematics and Computer Science, Faculty of Sciences and MathematicsUniversity of NišNisSerbia

Personalised recommendations