Theoretical Computer Science
Information Sciences: an International Journal
Algebraic aspects of families of fuzzy languages
Theoretical Computer Science - Algebraic methods in language processing
A probabilistic model of computing with words
Journal of Computer and System Sciences
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)
Artificial Intelligence
Fuzzy Sets and Systems
Equivalence in automata theory based on complete residuated lattice-valued logic
Fuzzy Sets and Systems
Fuzzy Sets and Systems
Automata theory based on quantum logic: Reversibilities and pushdown automata
Theoretical Computer Science
Supervisory control of fuzzy discrete event systems: a formal approach
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A formal model of computing with words
IEEE Transactions on Fuzzy Systems
Computing with words via Turing machines: a formal approach
IEEE Transactions on Fuzzy Systems
Myhill--Nerode type theory for fuzzy languages and automata
Fuzzy Sets and Systems
Fuzzy relation equations and reduction of fuzzy automata
Journal of Computer and System Sciences
Bisimulations for fuzzy automata
Fuzzy Sets and Systems
Construction of fuzzy automata from fuzzy regular expressions
Fuzzy Sets and Systems
Characterizations of complete residuated lattice-valued finite tree automata
Fuzzy Sets and Systems
Computation of the greatest simulations and bisimulations between fuzzy automata
Fuzzy Sets and Systems
Fuzzy relation equations and subsystems of fuzzy transition systems
Knowledge-Based Systems
Hi-index | 0.21 |
Automata theory based on complete residuated lattice-valued logic, called L-valued automata, has been proposed by Qiu [Automata theory based on complete residuated latticed-valued logic, Sci. China (Ser. F) 44 (6) (2001) 419-429; Automata theory based on complete residuated latticed-valued logic (II), Sci. China (Ser. F) 45 (6) (2002) 442-452]. In this paper, we discuss some properties of L-valued context-free grammars, languages, and pushdown automata. We show that, for such grammars, Chomsky and Greibach Normal Forms can be equivalently constructed, and we also prove that the languages accepted by final states and by empty stack in L-valued pushdown automata are equivalent. In particular, we prove the equivalence between L-valued context-free grammars and L-valued pushdown automata.