Fuzzy Linear Automata and Some Equivalences

Authors

  • Valdigleis S. Costa Doutorando em Ciência da Computação/Programa de Pós-graduação em Sistemas e Computação/Departamento de Informática e Matemática Aplicada/Universidade Federal do Rio Grande do Norte http://orcid.org/0000-0001-8738-5836
  • Benjamin Bedregal Departamento de Informática e Matemática Aplicada/Universidade Federal do Rio Grande do Norte http://orcid.org/0000-0002-6757-7934

DOI:

https://doi.org/10.5540/tema.2018.019.01.127

Keywords:

Fuzzy grammar, Fuzzy linear grammars, Fuzzy Language, Fuzzy Automata

Abstract

In this paper, we present two new normal forms for fuzzy linear grammars that  preserving language. In addition, we introduce two new classes of fuzzy machines, Fuzzy Linear Automata (FLA) and Fuzzy Nondeterministic 2-Tape Automata (2-FNA), we show the equivalence between them and also show that the class of fuzzy languages recognized by these machines is exactly the class of fuzzy linear languages, i.e., FLA and 2-DNA are recognized machines for class of fuzzy linear languages.

Author Biography

Valdigleis S. Costa, Doutorando em Ciência da Computação/Programa de Pós-graduação em Sistemas e Computação/Departamento de Informática e Matemática Aplicada/Universidade Federal do Rio Grande do Norte

Doutorando em Ciência da Computação pelo PPgSC do Departamento de Inforématica e Matemática Aplicada da UFRN

References

J. N. Mordeson and D. S. Malik, Fuzzy Automata and Languages: Theory and Applications. Washington, D. C., USA: Chapman & Hall/CRC, 2002.

S. R. Chaudhari and D. D. Komejwar, “On Fuzzy Regular Grammars,” Advances in Fuzzy Mathematics, vol. 6, no. 1, pp. 89–104, 2011.

W. G. Wee and K.-S. Fu, “A formulation of fuzzy automata and its application as a model of learning systems,” Systems Science and Cybernetics, IEEE Transactions, vol. 5, no. 3, pp. 215–223, 1969.

A. D. Silva Farias, L. R. de Araújo Lopes, B. R. C. Bedregal, and R. H. Santiago, “Closure properties for fuzzy recursively enumerable languages and fuzzy recursive languages,” Journal of Intelligent & Fuzzy Systems, vol. 31, no. 3, pp. 1795–1806, 2016.

A. D. Silva Farias, V. S. Costa, R. H. Santiago, and B. R. C. Bedregal, “A Residuated Function in a Class of Mealy Type L-Valued Finite Automaton,” in Fuzzy Information Processing Society (NAFIPS), 2016 Annual Conference of the North American, 2016.

H. Xing, Q. Daowen, and F. Liu, “Automata theory based on complete residuated lattice-valued logic: Pushdown automata,” Fuzzy Sets and Systems, vol. 160, no. 8, pp. 1125–1140, 2009.

J. E. Hopcroft, R. Motwani, and J. D. Ullman, Introduction To Automata Theory, Languages, and Computation. New York, USA: Addison-Wesley, 2ª ed., 2001.

B. R. C. Bedregal, B. M. Acióly, and A. Lyra, Introdução à Teoria da Computação: Linguagens Formais, Autômatos e Computabilidade. Natal, RN: EdUnP/FAPERN, 1ª ed., Nov. 2010.

L. A. Zadeh, “Fuzzy Sets,” Information and Control, vol. 8, pp. 338–353, 1965.

E. P. Klement, R. Mesiar, and E. Pap, Triangular Norms, vol. 8 of Trends in Logic. Poland: Springer-Science+Business Media, B.V., 2000.

K. Menger, “Statistical metrics,” Proc. Nat. Acad., vol. 28, pp. 535–537, 1942.

B. Schweizer and A. Sklar, “Associative functions and statistical triangle inequalities,” Publicationes Mathematicae Debrecen, vol. 8, pp. 168–186, 1961.

C. Alsina, E. Trillas, and L. Valverde, “On non-distributive logical connectives for fuzzy set theory,” BUSEFAL, vol. 3, pp. 18–29, 1980.

I. A. Silva, B. R. C. Bedregal, and H. Bustince, “Weighted Average Operators Generated by n-dimensional Overlaps and an Application in Decision Making,” in 16th World Congress of the International Fuzzy Systems Association, (Eindhoven, The Netherlands), pp. 1473–1478, EUSFLAT, 2015.

B. R. C. Bedregal and S. Figueira, “On the computing power of fuzzy Turing machines,” Fuzzy Sets and Systems, vol. 159, no. 9, pp. 1072–1083, 2008.

E. T. Lee and L. A. Zadeh, “Note on fuzzy languages,” Information Science,

vol. 1, pp. 421–434, 1969.

P. R. J. Asveld, “Fuzzy context-free languages—Part 1: Generalized fuzzy context-free grammars,” Theoretical Computer Science, vol. 347, pp. 167 190, 2005.

N. Chomsky, “Three models for the description of language,” IRE Transactions on Information Theory, vol. 2, pp. 113–124, 1956.

A. Maciel, “Aplicações de Autômatos Finitos Nebulosos no Reconhecimento Aproximado de Cadeias,” Master’s thesis, Escola Politécnica, Universidade de São Paulo, USP, São Paulo, SP, 2006.

B. R. C. Bedregal, “Nondeterministic Linear Automata and a Class of Deterministic Linear Languages,” in Preliminary Proceedings LSFA, 2015.

A. L. Rosemberg, “A Machime Realization of the Linear Context-Free Languages,” Information and Control, vol. 10, pp. 175–188, 1967.

B. R. C. Bedregal, “λ-ALN: Autômatos Lineares Não-Determinísticos com λ-Transições,” TEMA - Tendência em Matemática Aplicada e Computacional, vol. 12, no. 3, pp. 171–182, 2011.

Downloads

Published

2018-05-05

How to Cite

Costa, V. S., & Bedregal, B. (2018). Fuzzy Linear Automata and Some Equivalences. Trends in Computational and Applied Mathematics, 19(1), 127. https://doi.org/10.5540/tema.2018.019.01.127

Issue

Vol. 19 No. 1 (2018)

Section

Original Article

License

Copyright

Authors of articles published in the journal Trends in Computational and Applied Mathematics retain the copyright of their work. The journal uses Creative Commons Attribution (CC-BY) in published articles. The authors grant the TCAM journal the right to first publish the article.

Intellectual Property and Terms of Use

The content of the articles is the exclusive responsibility of the authors. The journal uses Creative Commons Attribution (CC-BY) in published articles. This license allows published articles to be reused without permission for any purpose as long as the original work is correctly cited.

The journal encourages Authors to self-archive their accepted manuscripts, publishing them on personal blogs, institutional repositories, and social media, as long as the full citation is included in the journal's website version.