Abstract
The theory of fuzzy recognizable languages over bounded distributive lattices is presented as a paradigm of recognizable formal power series. Due to the idempotency properties of bounded distributive lattices, the equality of fuzzy recognizable languages is decidable, the determinization of multi-valued automata is effective, and a pumping lemma exists. Fuzzy recognizable languages over finite and infinite words are expressively equivalent to sentences of the multi-valued monadic second-order logic. Fuzzy recognizability over bounded ℓ-monoids and residuated lattices is briefly reported. The chapter concludes with two applications of fuzzy recognizable languages to real world problems in medicine.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
P.R.J. Asveld. A bibliography on fuzzy automata, grammars and languages. Bulletin of the European Association for Theoretical Computer Science, 58:187–196, 1996.
P.R.J. Asveld. Algebraic aspects of families of fuzzy languages. Theoretical Computer Science, 293:417–445, 2003.
R. Balbes and P. Dwinger. Distributive Lattices. University of Missouri Press, Columbia, 1974.
N.C. Basak and A. Gupta. On quotient machines of a fuzzy automaton and the minimal machine. Fuzzy Sets and Systems, 125:223–229, 2002.
R. Bělohlávek. Determinism and fuzzy automata. Information Sciences, 143:205–209, 2002.
G. Birkhoff. Lattice Theory, revised edition, volume XXV of American Mathematical Society Colloquium Publications. American Mathematical Society, Providence, 1961.
B. Borchardt. A pumping lemma and decidability problems for recognizable tree series. Acta Cybernetica, 16:509–544, 2004.
S. Bozapalidis and O. Louscou-Bozapalidou. On the recognizability of fuzzy languages I. Fuzzy Sets and Systems, 157:2394–2402, 2006.
S. Bozapalidis and O. Louscou-Bozapalidou. On the recognizability of fuzzy languages II. Fuzzy Sets and Systems, 159:107–113, 2008.
G. Bruns and P. Godefroid. Model checking with multi-valued logics. In Proceedings of ICALP 2004, volume 3142 of Lecture Notes in Computer Science, pages 281–293. Springer, Berlin, 2004.
J.R. Büchi. On a decision method in restricted second order arithmetic. In Proceedings of International Congress for Logic, Methodology and Philosophy of Science, pages 1–11, 1962
A.L. Buchsbaum, R. Giancarlo, and J.R. Westbrook. On the determinization of weighted finite automata. SIAM Journal on Computing, 5:1502–1531, 2002.
M. Chechik, B. Devereux, and A. Gurfinkel. Model-checking infinite state-space systems with fine-grained abstractions using SPIN. In Proceedings of SPIN 2001, volume 2057 of Lecture Notes in Computer Science, pages 16–36. Springer, Berlin, 2001.
W. Cheng and Z. Mo. Minimization algorithm of fuzzy finite automata. Fuzzy Sets and Systems, 141:439–448, 2004.
M. Ćirić, A. Stamenković, J. Ignjatović, and T. Petković. Factorization of fuzzy automata. In Proceedings of FCT 2007, volume 4639 of Lecture Notes in Computer Science, pages 213–225. Springer, Berlin, 2007.
A.B. Davey and H.A. Priestley. Introduction to Lattices and Order, 2nd edition. Cambridge University Press, Cambridge, 2002.
M. Doostfatemeh and S.C. Kremer. New directions in fuzzy automata. International Journal of Approximate Reasoning, 38:175–214, 2005.
M. Droste and P. Gastin. Weighted automata and weighted logics. Theoretical Computer Science, 380:69–86, 2007. Extended abstract in: Proceedings of ICALP 2005, volume 3580 of Lecture Notes in Computer Science, pages 513–525. Springer, Berlin, 2005.
M. Droste and P. Gastin. On aperiodic and star-free formal power series in partially commuting variables. Theory of Computing Systems, 42:608–631, 2008. Extended abstract in: D. Krob, A.A. Milchalev, and A.V. Michalev, editors, Proceedings of the 12th International Conference on Formal Power Series and Algebraic Combinatorics, Moscow, pages 158–169. Springer, Berlin, 2000.
M. Droste and P. Gastin. Weighted automata and weighted logics. In this Handbook. Chapter 5. Springer, Berlin, 2009.
M. Droste and W. Kuich. Semirings and formal power series. In this Handbook. Chapter 1. Springer, Berlin, 2009.
M. Droste, W. Kuich, and G. Rahonis. Multi-valued MSO logics over words and trees. Fundamenta Informaticae, 84:305–327, 2008.
M. Droste and G. Rahonis. Weighted automata and weighted logics on infinite words. Russian Mathematics (Iz. VUZ), 2009, in press. Extended abstract in: Proceedings of DLT’06, volume 4036 of Lecture Notes in Computer Science, pages 49–58. Springer, Berlin, 2006.
S. Eilenberg. Automata, Languages and Machines, volume A. Academic Press, San Diego, 1974.
Z. Ésik and W. Kuich. A semiring-semimodule generalization of ω-regular languages I. Journal of Automata, Languages and Combinatorics, 10:203–242, 2005.
Z. Ésik and W. Kuich. A semiring-semimodule generalization of ω-regular languages II. Journal of Automata, Languages and Combinatorics, 10:243–264, 2005.
Z. Ésik and W. Kuich. Finite automata. In this Handbook. Chapter 3. Springer, Berlin, 2009.
Z. Ésik and G. Liu. Fuzzy tree automata. Fuzzy Sets and Systems, 158:1450–1460, 2007.
Z. Fülöp and H. Vogler. Weighted tree automata and tree transducers. In this Handbook. Chapter 9. Springer, Berlin, 2009.
S. Golan. Semirings and Their Applications. Kluwer Academic, Dordrecht, 1999.
A. Gurfinkel and M. Chechik. Multi-valued model checking via classical model checking. In Proceedings of CONCUR 2003, volume 2761 of Lecture Notes in Computer Science, pages 266–280. Springer, Berlin, 2003.
P. Hájek. Metamathematics of Fuzzy Logic. Kluwer Academic, Dordrecht, 1998.
J. Ignjatović, M. Ćirić, and S. Bogdanović. Determinization of fuzzy automata with membership values in complete residuated lattices. Information Sciences, 175:164–180, 2008.
D. Kirsten and I. Mäurer. On the determinization of weighted automata. Journal of Automata, Languages and Combinatorics, 10:287–312, 2005.
G. Klir and B. Yuan. Fuzzy Sets and Fuzzy Logic. Prentice Hall, Englewood Cliffs, 1995.
S. Konstandinidis, N. Sântean, and S. Yu. Fuzzification of rational and recognizable sets. Fundamenta Informaticae, 76:413–447, 2007.
W. Kuich and G. Rahonis. Fuzzy regular languages over finite and infinite words. Fuzzy Sets and Systems, 157:1532–1549, 2006.
W. Kuich and A. Salomaa. Semirings, Automata, Languages, volume 5 of Monographs in Theoretical Computer Science. An EATCS Series. Springer, Berlin, 1986.
O. Kupferman and Y. Lustig. Lattice automata. In Proceedings of VMCAI 2007, volume 4349 of Lecture Notes in Computer Science, pages 199–213. Springer, Berlin, 2007.
L. Lee and L.A. Zadeh. Note on fuzzy languages. Information Sciences, 1:421–434, 1969.
H. Lei and Y. Li. Minimization of states in automata theory based on finite lattice-ordered monoids. Information Sciences, 177:1413–1421, 2007.
Y. Li and W. Pedrycz. Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids. Fuzzy Sets and Systems, 156:68–92, 2005.
Y. Li and W. Pedrycz. Minimization of lattice finite automata and its application to the decomposition of lattice languages. Fuzzy Sets and Systems, 158:1423–1436, 2007.
F. Lin and H. Ying. Modeling and control of fuzzy discrete event systems. IEEE Transactions on Systems, Man and Cybernetics—Part B: Cybernetics, 32:408–415, 2002.
F. Lin, H. Ying, R.D. MacArthur, J.A. Cohn, D.C. Barth-Jones, H. Ye, and L.R. Crane. Decision making in fuzzy discrete event systems. Information Sciences, 177:3749–3763, 2007.
O. Louskou-Bozapalidou. Fuzzy congruences on fuzzy algebras. Applied Mathematical Sciences (Hikari), 1:815–819, 2007.
O. Louskou-Bozapalidou. Non-deterministic recognizability of fuzzy languages. Applied Mathematical Sciences (Hikari), 1:821–826, 2007.
J. Łukasiewicz. O logice trojwartosciowej. Ruch Filosoficzny, 5:169–171, 1920.
D.S. Malik, J.N. Mordeson, and M.K. Sen. Minimization of fuzzy finite automata. Information Sciences, 113:323–330, 1999.
G. Malinowski. Many-Valued Logics. Oxford Science Publications, Oxford, 1993.
A. Mateescu, A. Salomaa, K. Salomaa, and S. Yu. Lexical analysis with a finite-fuzzy-automaton model. Journal of Universal Computer Science, 1:292–311, 1995.
M. Mohri. Finite-state transducers in language and speech processing. Computational Linguistics, 23:269–311, 1997.
M. Mohri. Weighted automata algorithms. In this Handbook. Chapter 6. Springer, Berlin, 2009.
J. Mordeson and D. Malik. Fuzzy Automata and Languages: Theory and Applications. Chapman & Hall/CRC, London, 2002.
A. Pathak and S.K. Pal. Fuzzy grammars in syntactic recognition of skeletal maturity from X-rays. IEEE Transactions on Systems, Man and Cybernetics, 16:657–667, 1986.
D. Perrin and E.J. Pin. Infinite Words. Elsevier, Amsterdam, 2004.
T. Petković. Varietes of fuzzy languages. In Proceedings of the 1st International Conference on Algebraic Informatics, pages 197–205. Aristotle University of Thessaloniki, Thessaloniki, 2005.
T. Petković. Congruences and homomorphisms of fuzzy automata. Fuzzy Sets and Systems, 157:444–458, 2006.
E.L. Post. Introduction to a general theory of elementary propositions. American Journal of Mathematics, 43:163–185, 1921.
D. Qiu. Automata theory based on complete residuated lattice-valued logic. Science in China. Series F, 44:419–429, 2001.
D. Qiu. Automata theory based on complete residuated lattice-valued logic (II). Science in China. Series F, 45:442–452, 2002.
D. Qiu. Pumping lemma in automata theory based on complete residuated lattice-valued logic: A note. Fuzzy Sets and Systems, 157:2128–2138, 2006.
G. Rahonis. Infinite fuzzy computations. Fuzzy Sets and Systems, 153:275–288, 2005.
J.B. Rosser and A.R. Turquette. Many Valued Logics. North-Holland, Amsterdam, 1952.
J. Sakarovitch. Rational and recognisable power series. In this Handbook. Chapter 4. Springer, Berlin, 2009.
A. Salomaa. Moisil and many-valued logic. In A. Iorgulescu, S. Marcus, S. Rudeanu, and D. Vaida, editors, Grigore C. Moisil and his Followers in Theoretical Computer Science, pages 29–39. Editura Academiei Romane, Bucharest, 2007.
A. Salomaa and M. Soittola. Automata-Theoretic Aspects of Formal Power Series. Texts and Monographs in Computer Science. Springer, Berlin, 1978.
E. Santos. Maximin automata. Information and Control, 13:363–377, 1968.
E. Santos. On reductions of maximin machines. Journal of Mathematical Analysis and Applications, 40:60–78, 1972.
B. Šešelja. Homomorphisms of poset-valued algebras. Fuzzy Sets and Systems, 121:333–340, 2001.
B. Šešelja and A. Tepavčević. On a generalization of fuzzy algebras and congruences. Fuzzy Sets and Systems, 65:85–94, 1994.
A. Tepavčević and G. Trajkovski. L-fuzzy lattices: An introduction. Fuzzy Sets and Systems, 223:209–216, 2001.
M. Ward and R.P. Dilworth. Residuated lattices. Transactions of the American Mathematical Society, 45:335–354, 1939.
W. Wechler. The Concept of Fuzziness in Automata and Language Theory. Akademie Verlag, Berlin, 1978.
W.G. Wee. On generalization of adaptive algorithm and applications of the fuzzy sets concept to pattern classification. PhD dissertation, Purdue University, Lafayette, 1967.
H. Ying, F. Lin, R.D. MacArthur, J.A. Cohn, D.C. Barth-Jones, H. Ye, and L.R. Crane. A fuzzy discrete event system approach determining optimal HIV/AIDS treatment regimens. IEEE Transactions on Information Technology in Biomedicine, 10:663–676, 2006.
H. Ying, F. Lin, R.D. MacArthur, J.A. Cohn, D.C. Barth-Jones, H. Ye, and L.R. Crane. A self-learning fuzzy discrete event system approach determining optimal HIV/AIDS treatment regimen selection. IEEE Transactions on Systems, Man and Cybernetics—Part B: Cybernetics, 37:966–979, 2007.
L.A. Zadeh. Fuzzy sets. Information and Control, 8:338–353, 1965.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Rahonis, G. (2009). Fuzzy Languages. In: Droste, M., Kuich, W., Vogler, H. (eds) Handbook of Weighted Automata. Monographs in Theoretical Computer Science. An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01492-5_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-01492-5_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-01491-8
Online ISBN: 978-3-642-01492-5
eBook Packages: Computer ScienceComputer Science (R0)