Fuzzy state grammar and fuzzy deep pushdown automaton
Nidhi Kalra, Ajay Kumar · Journal of Intelligent & Fuzzy Systems · 2016
Motivated by the concept of fuzzy finite automata and fuzzy pushdown automata, we investigate a novel fuzzy state grammars and fuzzy deep pushdown automata concept. This concept represents a natural extension of contemporary state grammar and deep pushdown automaton, making them more robust in term s of imprecision, errors, and uncertainty. It has been proved that we can construct fuzzy deep pushdown automata from fuzzy state grammars and vice-versa. Furthermore, it has been proved that if fuzzy deep pushdown automaton Mfd is constructed from fuzzy state grammar Gfs then L (Mfd) = L (Gfs). In other words, for any string α ∈ Σ*, μ (α ; α ∈ L (Gfs)) = μ (α ; α ∈ L (Mfd)) where μ denotes the membership of a string.