Fuzzy Linear Automata and Some Equivalences
ABSTRACT In this paper, we present two new normal forms for fuzzy linear grammars. Moreover, we introduce two new classes of fuzzy machines. The first is the class of fuzzy linear automata (FLA). We show that automata of this type is equivalent to the fuzzy linear grammar, i.e., we prove that the class of fuzzy languages is recognized by fuzzy linear automata. Finally, we introduce the class of fuzzy nondeterministic 2-tape automata (FNTA), show the equivalence between them and fuzzy linear automata.
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Digital revista |
| Language: | English |
| Published: |
Sociedade Brasileira de Matemática Aplicada e Computacional
2018
|
| Online Access: | http://old.scielo.br/scielo.php?script=sci_arttext&pid=S2179-84512018000100127 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|