Fuzzy pushdown automata

  • Authors:
  • Hongyan Xing

  • Affiliations:
  • Faculty of Applied Mathematics, Guangdong University of Technology, Guangzhou 510090, PR China and Department of Computer Science, Zhongshan University, Guangzhou 510275, PR China

  • Venue:
  • Fuzzy Sets and Systems
  • Year:
  • 2007

Quantified Score

Hi-index 0.21

Visualization

Abstract

Inspired by the similarity of fuzzy regular language to crisp case and the relationship between nondeterministic fuzzy finite automaton and fuzzy regular languages, we study fuzzy pushdown automaton (FPDA) and fuzzy context-free languages (FCFLs). As a generalization, we investigate the movement of one-stack FPDA and discuss the character of multistack FPDA in accepting languages. We get the concept that languages generated by fuzzy context-free K-grammars the languages accepted by one-stack or multistack FPDA are all in the family of FCFL, or say, are usually included in a family of languages generated by A"f(K)-fuzzy context-free grammars.