Fuzzy pushdown automata
暂无分享,去创建一个
FUZZY phushdown automata and B-fuzzy pushdown automata are defined as an extension of pushdown automata. It is shown that the B-fuzzy pushdown automata can accept context sensitive languages by setting a threshold, while the (fuzzy) pushdown automata can accept only context-free languages.
[1] Alfred V. Aho,et al. The Theory of Parsing, Translation, and Compiling , 1972 .
[2] Jun'ichi Toyoda,et al. Various Kinds of Automata with Weights , 1975, J. Comput. Syst. Sci..
[3] Masaharu Mizumoto,et al. FUZZY AUTOMATA AND FUZZY GRAMMARS , 1971 .
[4] J. Toyoda,et al. B-fuzzy grammars , 1974 .