Finite automata theory with membership values in lattices

DOI10.1016/j.ins.2010.11.006zbMath1209.68302OpenAlexW2033478883WikidataQ62038176 ScholiaQ62038176MaRDI QIDQ632699

Yong-Ming Li

Publication date: 25 March 2011

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2010.11.006

zbMATH Keywords

latticelanguagefinite automatasubset constructionKleene theorem

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Lattices (06B99)

Related Items

The universal fuzzy automaton ⋮ On intuitionistic fuzzy context-free languages ⋮ State hyperstructures of tree automata based on lattice-valued logic ⋮ Nondeterministic finite automata based on quantum logic: language equivalence relation and robustness ⋮ Fuzzy alternating Büchi automata over distributive lattices ⋮ On quotients of formal power series ⋮ Fuzzy grammar theory based on lattices ⋮ Fuzzy \(\epsilon\)-approximate regular languages and minimal deterministic fuzzy automata \(\epsilon\)-accepting them ⋮ Model checking computation tree logic over finite lattices ⋮ Bisimulations for fuzzy automata ⋮ Bipolar fuzzy graphs ⋮ Determinization of fuzzy automata by factorizations of fuzzy states and right invariant fuzzy quasi-orders ⋮ Conversion of fuzzy automata into fuzzy regular expressions using transitive closure ⋮ Algebraic and topological structures on factorizations of fuzzy sets1 ⋮ ON SOMEWHAT FUZZY AUTOMATA CONTINUOUS FUNCTIONS IN FUZZY AUTOMATA TOPOLOGICAL SPACES ⋮ Logical characterizations of simulation and bisimulation for fuzzy transition systems ⋮ A generalization of Myhill-Nerode theorem for fuzzy languages ⋮ Nondeterministic fuzzy automata with membership values in complete residuated lattices ⋮ Dynamic logic assigned to automata ⋮ Lattice-valued finite state machines and lattice-valued transformation semigroups ⋮ On characterization of fuzzy tree pushdown automata ⋮ Construction of fuzzy automata from fuzzy regular expressions ⋮ Nondeterministic fuzzy automata ⋮ Model checking of linear-time properties in multi-valued systems ⋮ On minimal realization of fuzzy behaviour and associated categories ⋮ Conditions for the existence of maximal factorizations ⋮ The relationships among several forms of weighted finite automata over strong bimonoids

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Automata theory based on quantum logic: Some characterizations
• Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids
• Pumping lemma in automata theory based on complete residuated lattice-valued logic: a note
• Automata theory based on complete residuated lattice-valued logic
• Automata theory based on complete residuated lattice-valued logic. II
• Determinism and fuzzy automata
• Formal power series and regular operations on fuzzy languages
• Minimization of lattice finite automata and its application to the decomposition of lattice languages
• Notes on automata theory based on quantum logic
• Weighted automata and weighted logics
• Automata theory based on quantum logic: reversibilities and pushdown automata
• Determinization of fuzzy automata with membership values in complete residuated lattices
• Fuzzy regular languages over finite and infinite words
• The relationships among several types of fuzzy automata
• Algebraic properties of \(LA\)-languages
• A theory of computation based on quantum logic. I
• On the definition of a family of automata