Linguagens lineares fuzzy

Abstract

Formal languages defined in the late 50’s play an important role in computer science, especially for applications in lexical and syntactic analysis in the construction of compilers and also in grammatical inference techniques. The extended Chomsky hierarchy in addition to “organize” formal languages, enables us to draw a relationship between the classes of languages and formalisms in terms of state machines (or automata). Among the languages classes in the hierarchy, one can find the linear languages. For such languages of this class, there are at least four types of “devices” performing computations on them. One can highlight the Nondeterministic Linear Automata, as proposed by Bedregal. In the end of the 60s, Lee and Zadeh proposed fuzzy languages in an attempt to decrease the distance between formal languages and natural languages. In turn, Wee and Fu capture the concept of uncertainty as they introduced the concept of fuzzy automata during the process of recognizing a language, similarly to the classical theory. Therefore, one can trace a relationship between the classes of fuzzy language and fuzzy automata. However, differently from the classical theory, up to now there is no designed fuzzy automata directly to compute on the class of fuzzy linear languages, i.e., relating to fuzzy linear languages directly. Therefore, this work aims to carry out a study on the construction of fuzzy automata developed to recognize the fuzzy linear languages. Furthermore, based on the study of formal languages, the investigation of the closure operators on languages classes is an important point; this work will also investigate which of the operators (union, intersection, etc.) are closed on the classes of fuzzy linear languages.