IT-2 General Fuzzy Automata

  • khadijeh abolpour Dept. of Math., Shi. C., Islamic Azad University, Shiraz, Iran
  • Marzie Shamsizadeh
DOI: https://doi.org/10.5269/bspm.76449

Abstract

This study focuses on exploring and advancing the concept of interval type-2 general fuzzy automata, abbreviated as IT-2 GFA. It examines the relationship between IT-2 general fuzzy automata and IT-2 fuzzy regular grammars. Additionally, various operations on IT-2 fuzzy languages are defined. The findings reveal that IT-2 fuzzy languages, recognized by IT-2 general fuzzy automata, are closed under operations such as union, intersection, concatenation, and Kleene closure, but they do not exhibit closure under the complement operation. To illustrate the concepts and results of this study, several representative examples are also provided.

Downloads

Download data is not yet available.
Published
2025-09-30
Issue
Vol 43 (2025)
Section
Research Articles

Copyright (c) 2025 Boletim da Sociedade Paranaense de Matemática

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

When the manuscript is accepted for publication, the authors agree automatically to transfer the copyright to the (SPM).

The journal utilize the Creative Common Attribution (CC-BY 4.0).

 

Crossref
Scopus
Google Scholar
Europe PMC