pith. machine review for the scientific record. sign in

arxiv: 1411.2865 · v2 · submitted 2014-11-11 · 💻 cs.FL

Recognition: unknown

Metamorphosis of Fuzzy Regular Expressions to Fuzzy Automata using the Follow Automata

Authors on Pith no claims yet
classification 💻 cs.FL
keywords automatafuzzyexpressionsregularapproachconstructionfollowfinite
0
0 comments X
read the original abstract

To deal with system uncertainty, finite automata have been generalized into fuzzy automata. Stamenkovic and Ciric proposed an approach using the position automata for the construction of fuzzy automata from fuzzy regular expressions. There exist multifarious methodologies for the construction of finite automata from regular expressions known as Thompson construction, Antimirov partial derivatives, Glushkov automata and follow automata etc. In this paper, we propose an approach for the conversion of fuzzy regular expressions into fuzzy automata using the concept of follow automata. The number of states of the obtained Fuzzy automata using the proposed approach is lesser than the extant approaches in the literature.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.