Pumping lemma in automata theory based on complete residuated lattice-valued logic: a note
From MaRDI portal
(Redirected from Publication:853474)
Recommendations
- Pumping Lemma in context-free grammar theory based on complete residuated lattice-valued logic
- Automata theory based on complete residuated lattice-valued logic
- Automata theory based on complete residuated lattice-valued logic: Pushdown automata
- A comment on ``Automata theory based on complete residuated lattice-valued logic: pushdown automata
- Automata theory based on quantum logic. II.
Cites work
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 1862743 (Why is no real title available?)
- scientific article; zbMATH DE number 3307592 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- scientific article; zbMATH DE number 3392404 (Why is no real title available?)
- scientific article; zbMATH DE number 3414288 (Why is no real title available?)
- Abstract residuation over lattices
- Automata theory based on complete residuated lattice-valued logic
- Automata theory based on complete residuated lattice-valued logic. II
- Axiom schemes for m-valued propositions calculi
- Deterministic Acceptors of Regular Fuzzy Languages
- Efficient simulation of finite automata by neural nets
- Fuzzifying topology based on complete residuated lattice-valued logic. I
- Fuzzy discrete structures
- Fuzzy sets and systems. Theory and applications
- Linear logic
- Maximin automata
- On Fuzzy Logic I Many‐valued rules of inference
- On Fuzzy Logic II. Enriched residuated lattices and semantics of propositional calculi
- On Fuzzy Logic III. Semantical completeness of some many‐valued propositional calculi
Cited in
(56)- Grammar theory based on lattice-ordered monoid
- Simulation for lattice-valued doubly labeled transition systems
- Algebraic properties of complete residuated lattice valued tree automata
- TREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS
- GENERAL FUZZY AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED
- Lattice-valued fuzzy Turing machines: computing power, universality and efficiency
- Bisimulations for fuzzy automata
- Brzozowski type determinization for fuzzy automata
- Fuzzy languages with infinite range accepted by fuzzy automata: pumping lemma and determinization procedure
- Weak bisimulations for fuzzy automata
- On a factorized \(L\)-fuzzy automaton and its \(L\)-fuzzy topological characterization
- ADMISSIBLE PARTITION FOR BL-GENERAL FUZZY AUTOMATON
- Lattice-Semigroups Tree Automation’s Congruence and Homomorphism
- On the greatest solutions to weakly linear systems of fuzzy relation inequalities and equations
- Finite automata theory with membership values in lattices
- Fuzzy pushdown automata
- L-fuzzy automata theory: some characterizations via general fuzzy operators
- On L-fuzzy automata, coalgebras and dialgebras: associated categories and L-fuzzy topologies
- Automata theory based on complete residuated lattice-valued logic: Turing machines
- Computation of the greatest simulations and bisimulations between fuzzy automata
- Reduction of fuzzy automata by means of fuzzy quasi-orders
- Categories of Automata and Languages Based on a Complete Residuated Lattice
- Automata theory based on complete residuated lattice-valued logic. II
- Myhill-Nerode type theory for fuzzy languages and automata
- Automata theory based on complete residuated lattice-valued logic: Reduction and minimization
- Fuzzy relation equations and reduction of fuzzy automata
- Automata theory based on complete residuated lattice-valued logic: Pushdown automata
- Pumping Lemma in context-free grammar theory based on complete residuated lattice-valued logic
- Automata theory based on complete residuated lattice-valued logic: a categorical approach
- Residuated lattice-valued automata based on graphs
- A comment on ``Automata theory based on complete residuated lattice-valued logic: pushdown automata
- Determinization of fuzzy automata by factorizations of fuzzy states and right invariant fuzzy quasi-orders
- Characterizations of complete residuated lattice-valued finite tree automata
- Construction of fuzzy automata from fuzzy regular expressions
- State hyperstructures of tree automata based on lattice-valued logic
- scientific article; zbMATH DE number 7528980 (Why is no real title available?)
- On the category of \(L\)-fuzzy automata, coalgebras and dialgebras
- Lattice-valued simulations for quantitative transition systems
- Formal power series and regular operations on fuzzy languages
- Fuzzy tree language recognizability
- Fuzzy multiset finite automata and their languages
- Equivalence in automata theory based on complete residuated lattice-valued logic
- Determinization of fuzzy automata with membership values in complete residuated lattices
- TOPOLOGICAL CHARACTERIZATION FOR FUZZY REGULAR LANGUAGES
- Algebraic properties of approximate bisimulation relations for fuzzy automata
- On closure properties of \(\mathcal{L}\)-valued linear languages
- Nondeterministic fuzzy automata with membership values in complete residuated lattices
- Coding tree languages based on lattice-valued logic
- Similarity-based minimization of fuzzy tree automata
- Logical characterizations of simulation and bisimulation for fuzzy transition systems
- Fuzzy grammar theory based on lattices
- On intuitionistic fuzzy context-free languages
- Minimization of hesitant L-fuzzy automaton.
- On compositions of (L-fuzzy) automata: a categorical approach
- Approximate bisimulations for fuzzy-transition systems
- Further improvements of determinization methods for fuzzy finite automata
This page was built for publication: Pumping lemma in automata theory based on complete residuated lattice-valued logic: a note
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q853474)
