State hyperstructures of tree automata based on lattice-valued logic (Q4553830): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q129539271, #quickstatements; #temporary_batch_1724702838668
 
(4 intermediate revisions by 4 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.1051/ita/2018004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2813640253 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4220167 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fuzzy tree language recognizability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4351232 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3137919 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4870876 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4706962 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fuzzy \(H_v\)-groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4238595 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2717063 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intuitionistic \((S,T)\)-fuzzy hyperquasigroups. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fuzzy tree automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449537 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determinization of fuzzy automata with membership values in complete residuated lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4076799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3323279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of complete residuated lattice-valued finite tree automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2968333 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coding tree languages based on lattice-valued logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic properties of complete residuated lattice valued tree automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3639886 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fuzzy Tree Automata and Syntactic Pattern Recognition / 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: Finite automata theory with membership values in lattices / 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: Q5758708 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3975648 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4870899 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4870898 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Similarity-based minimization of fuzzy tree automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4791753 / 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: General formulation of sequential machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Acceptors of Regular Fuzzy Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Formulation of Fuzzy Automata and Its Application as a Model of Learning Systems / 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: 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
Property / cites work
 
Property / cites work: Fuzzy sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4888036 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129539271 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:09, 26 August 2024

scientific article; zbMATH DE number 6969811
Language Label Description Also known as
English
State hyperstructures of tree automata based on lattice-valued logic
scientific article; zbMATH DE number 6969811

    Statements

    State hyperstructures of tree automata based on lattice-valued logic (English)
    0 references
    0 references
    1 November 2018
    0 references
    tree automaton
    0 references
    lattice-valued logic
    0 references
    Kleene's theorem
    0 references
    hypergroup
    0 references
    minimization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references