Introduction to Formal Language Theory
Introduction to Formal Language Theory
The theory of parsing, translation, and compiling
The theory of parsing, translation, and compiling
Controlled Fuzzy Parallel Rewriting
New Trends in Formal Languages - Control, Cooperation, and Combinatorics (to Jürgen Dassow on the occasion of his 50th birthday)
A Generalisation of Parikh's Theorem in Formal Language Theory
Proceedings of the 2nd Colloquium on Automata, Languages and Programming
Fuzzy context-free languages: part 1: Generalized fuzzy context-free grammars
Theoretical Computer Science
Fuzzy context-free languages: part 2: Recognition and parsing algorithms
Theoretical Computer Science
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Supervisory control of fuzzy discrete event systems: a formal approach
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Computing with words via Turing machines: a formal approach
IEEE Transactions on Fuzzy Systems
Automata theory based on complete residuated lattice-valued logic: Pushdown automata
Fuzzy Sets and Systems
Fuzzy hyperrings (Hv-rings) based on fuzzy universal sets
Information Sciences: an International Journal
Nondeterministic fuzzy automata
Information Sciences: an International Journal
Hi-index | 0.21 |
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.