State Minimization of General Finite Fuzzy Automata

The minimization of automaton is important to reduce space and computational time. Reduction in number of states and transitions leads to equivalent automaton with less number of states and transitions. In this paper, state minimization of General Finite Fuzzy Automata (GFFA) is discussed. To obtain...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Ranjeet Kaur, Alka Tripathi
Formato: article
Lenguaje:EN
Publicado: International Journal of Mathematical, Engineering and Management Sciences 2021
Materias:
T
Acceso en línea:https://doaj.org/article/eff62fba15304ce5be3ac6eb7ea7740f
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
id oai:doaj.org-article:eff62fba15304ce5be3ac6eb7ea7740f
record_format dspace
spelling oai:doaj.org-article:eff62fba15304ce5be3ac6eb7ea7740f2021-12-04T05:31:55ZState Minimization of General Finite Fuzzy Automata10.33889/IJMEMS.2021.6.6.1012455-7749https://doaj.org/article/eff62fba15304ce5be3ac6eb7ea7740f2021-12-01T00:00:00Zhttps://ijmems.in/cms/storage/app/public/uploads/volumes/101-IJMEMS-21-0193-6-6-1709-1728-2021.pdfhttps://doaj.org/toc/2455-7749The minimization of automaton is important to reduce space and computational time. Reduction in number of states and transitions leads to equivalent automaton with less number of states and transitions. In this paper, state minimization of General Finite Fuzzy Automata (GFFA) is discussed. To obtain minimal equivalent GFFA we have removed redundant states and transitions using substitution property (SP) partition and quotient machine. The algorithm to find membership values of states of the GFFA is described and algorithm to associate states with quotient machine to obtain minimal machine with less number of states is discussed.Ranjeet KaurAlka TripathiInternational Journal of Mathematical, Engineering and Management Sciencesarticlegeneral fuzzy automataminimal automataquotient machinesubstitution property partitionTechnologyTMathematicsQA1-939ENInternational Journal of Mathematical, Engineering and Management Sciences, Vol 6, Iss 6, Pp 1709-1728 (2021)
institution DOAJ
collection DOAJ
language EN
topic general fuzzy automata
minimal automata
quotient machine
substitution property partition
Technology
T
Mathematics
QA1-939
spellingShingle general fuzzy automata
minimal automata
quotient machine
substitution property partition
Technology
T
Mathematics
QA1-939
Ranjeet Kaur
Alka Tripathi
State Minimization of General Finite Fuzzy Automata
description The minimization of automaton is important to reduce space and computational time. Reduction in number of states and transitions leads to equivalent automaton with less number of states and transitions. In this paper, state minimization of General Finite Fuzzy Automata (GFFA) is discussed. To obtain minimal equivalent GFFA we have removed redundant states and transitions using substitution property (SP) partition and quotient machine. The algorithm to find membership values of states of the GFFA is described and algorithm to associate states with quotient machine to obtain minimal machine with less number of states is discussed.
format article
author Ranjeet Kaur
Alka Tripathi
author_facet Ranjeet Kaur
Alka Tripathi
author_sort Ranjeet Kaur
title State Minimization of General Finite Fuzzy Automata
title_short State Minimization of General Finite Fuzzy Automata
title_full State Minimization of General Finite Fuzzy Automata
title_fullStr State Minimization of General Finite Fuzzy Automata
title_full_unstemmed State Minimization of General Finite Fuzzy Automata
title_sort state minimization of general finite fuzzy automata
publisher International Journal of Mathematical, Engineering and Management Sciences
publishDate 2021
url https://doaj.org/article/eff62fba15304ce5be3ac6eb7ea7740f
work_keys_str_mv AT ranjeetkaur stateminimizationofgeneralfinitefuzzyautomata
AT alkatripathi stateminimizationofgeneralfinitefuzzyautomata
_version_ 1718372827672870912