A coalgebraic approach to fuzzy automata
In this thesis, we make a coalgebraic description of fuzzy automata allowing their integration in much general context. Thus, results obtained indivudually to fuzzy automata end up to be consequence of their coalgebraic description. In particular, a coalgebraic definition of the fuzzy language recog...
| Autor principal: | |
|---|---|
| Formato: | masterThesis |
| Idioma: | eng |
| Publicado em: |
2016
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10362/18452 |
| País: | Portugal |
| Oai: | oai:run.unl.pt:10362/18452 |
| Resumo: | In this thesis, we make a coalgebraic description of fuzzy automata allowing their integration in much general context. Thus, results obtained indivudually to fuzzy automata end up to be consequence of their coalgebraic description. In particular, a coalgebraic definition of the fuzzy language recognized by a fuzzy automaton is obtained. And, by defining a monad for fuzzy sets, a functor that describes a determinization process via a generalization of the powerset construction is obtained. |
|---|