Characterizations of complete residuated lattice-valued finite tree automata (Q1759726): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.fss.2011.11.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1986566706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fuzzy tree language recognizability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak Second‐Order Arithmetic and Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization algorithm of fuzzy finite automata. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fuzzy tree automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4076799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4179852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization of states in automata theory based on finite lattice-ordered monoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization of lattice finite automata and its application to the decomposition of lattice languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fuzzy discrete structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4520282 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4791753 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Fuzzy Logic I Many‐valued rules of inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Fuzzy Logic II. Enriched residuated lattices and semantics of propositional calculi / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Fuzzy Logic III. Semantical completeness of some many‐valued propositional calculi / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata theory based on complete residuated lattice-valued logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata theory based on complete residuated lattice-valued logic. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of fuzzy finite automata. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pumping lemma in automata theory based on complete residuated lattice-valued logic: a note / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on Trillas' CHC models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Axiom schemes for <i>m</i>-valued propositions calculi / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata theory based on complete residuated lattice-valued logic: Reduction and minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pumping Lemma in context-free grammar theory based on complete residuated lattice-valued logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata theory based on complete residuated lattice-valued logic: Pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence in automata theory based on complete residuated lattice-valued logic / rank
 
Normal rank

Latest revision as of 22:34, 5 July 2024

scientific article
Language Label Description Also known as
English
Characterizations of complete residuated lattice-valued finite tree automata
scientific article

    Statements

    Characterizations of complete residuated lattice-valued finite tree automata (English)
    0 references
    0 references
    0 references
    22 November 2012
    0 references
    0 references
    formal languages
    0 references
    tree automata
    0 references
    pumping lemma
    0 references
    \(L\)-valued regular tree languages
    0 references
    homomorphism
    0 references
    minimization algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references