Linguagens lineares fuzzy
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 langua...
Na minha lista:
| Autor principal: | |
|---|---|
| Outros Autores: | |
| Formato: | Dissertação |
| Idioma: | por |
| Publicado em: |
Brasil
|
| Assuntos: | |
| Endereço do item: | https://repositorio.ufrn.br/jspui/handle/123456789/25642 |
| Tags: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|
| id |
ri-123456789-25642 |
|---|---|
| record_format |
dspace |
| institution |
Repositório Institucional |
| collection |
RI - UFRN |
| language |
por |
| topic |
Linguagens formais Linguagens lineares Autômatos lineares Linguagens fuzzy Autômatos fuzzy CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO::SISTEMAS DE COMPUTACAO |
| spellingShingle |
Linguagens formais Linguagens lineares Autômatos lineares Linguagens fuzzy Autômatos fuzzy CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO::SISTEMAS DE COMPUTACAO Costa, Valdigleis da Silva Linguagens lineares fuzzy |
| description |
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. |
| author2 |
Bedregal, Benjamin Rene Callejas |
| author_facet |
Bedregal, Benjamin Rene Callejas Costa, Valdigleis da Silva |
| format |
masterThesis |
| author |
Costa, Valdigleis da Silva |
| author_sort |
Costa, Valdigleis da Silva |
| title |
Linguagens lineares fuzzy |
| title_short |
Linguagens lineares fuzzy |
| title_full |
Linguagens lineares fuzzy |
| title_fullStr |
Linguagens lineares fuzzy |
| title_full_unstemmed |
Linguagens lineares fuzzy |
| title_sort |
linguagens lineares fuzzy |
| publisher |
Brasil |
| publishDate |
2018 |
| url |
https://repositorio.ufrn.br/jspui/handle/123456789/25642 |
| work_keys_str_mv |
AT costavaldigleisdasilva linguagenslinearesfuzzy |
| _version_ |
1773964783182151680 |
| spelling |
ri-123456789-256422019-01-30T11:03:02Z Linguagens lineares fuzzy Costa, Valdigleis da Silva Bedregal, Benjamin Rene Callejas Cruz, Anderson Paiva Santiago, Regivan Hugo Nunes Reiser, Renata Hax Sander Linguagens formais Linguagens lineares Autômatos lineares Linguagens fuzzy Autômatos fuzzy CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO::SISTEMAS DE COMPUTACAO 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. Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES) As linguagens formais definidas no final da década de 50, tem uma grande importância dentro da ciência da computação, em especial para aplicações em análise léxica e sintática dentro da construção dos compiladores e também em técnicas de inferência gramatical. A hierarquia estendida de Chomsky além de “organizar” as linguagens formais, nos possibilita traçar uma relação entre as classes de linguagens e os formalismos em termos de máquinas de estados (ou autômatos). Entre as classes de linguagens na hierarquia estão as linguagens lineares, para as linguagens desta classe existem no mínimo quatro tipos de “dispositivos”, que computam sobre elas. Entre eles estão os λ-autômatos lineares não-determinísticos propostos por Bedregal. Ao final da década de 60, Lee e Zadeh propuseram as linguagens fuzzy, numa tentativa de diminuir a distância entre as linguagens formais e as linguagens naturais. Por sua vez, Wee e Fu para capturar a noção de incerteza, durante o processo de reconhecimento de cadeias de uma linguagem, introduzem o conceito de autômatos fuzzy. Assim como na teoria clássica, podemos traçar uma relação entre as classes das linguagens fuzzy e os autômatos fuzzy. No entanto, diferente da teoria clássica, até o presente momento não existe nenhum autômato fuzzy concebido diretamente para computar sobre a classe das linguagens lineares fuzzy, isto é, que se relacione com as linguagens lineares fuzzy de forma direta. Portanto, este trabalho se propõe a realizar um estudo sobre a construção de autômatos fuzzy desenvolvidos para reconhecer as linguagens lineares fuzzy. Além disso, dado que dentro do estudo de linguagens formais, a investigação dos operadores de fecho sobre as classes de linguagens é um importante ponto, neste trabalho, iremos também investigar quais dos operadores (união, intersecção, etc) são fechados sobre as classes das linguagens lineares fuzzy. 2018-07-30T22:29:06Z 2018-07-30T22:29:06Z 2016-08-05 masterThesis COSTA, Valdigleis da Silva. Linguagens lineares fuzzy. 2016. 90f. Dissertação (Mestrado em Sistemas e Computação) - Centro de Ciências Exatas e da Terra, Universidade Federal do Rio Grande do Norte, Natal, 2016. https://repositorio.ufrn.br/jspui/handle/123456789/25642 por Acesso Aberto application/pdf Brasil UFRN PROGRAMA DE PÓS-GRADUAÇÃO EM SISTEMAS E COMPUTAÇÃO |