Different Operators in Automata Theory Based on Residuated and Co-Residuated Lattices
From MaRDI portal
Publication:5874592
Recommendations
- Automata theory based on complete residuated lattice-valued logic
- On \(L^M\)-valued automata: an operator oriented view
- Algebraic properties of complete residuated lattice valued tree automata
- Automata theory based on complete residuated lattice-valued logic: a categorical approach
- Topological characterizations of automata theory based on quantum logic
Cites work
- scientific article; zbMATH DE number 2085410 (Why is no real title available?)
- scientific article; zbMATH DE number 3770955 (Why is no real title available?)
- scientific article; zbMATH DE number 3526591 (Why is no real title available?)
- scientific article; zbMATH DE number 722213 (Why is no real title available?)
- scientific article; zbMATH DE number 1862743 (Why is no real title available?)
- scientific article; zbMATH DE number 3367095 (Why is no real title available?)
- A CATEGORY OF FUZZY AUTOMATA
- A fuzzy topology associated with a fuzzy finite state machine
- A topology for automata. II
- A topology for automata: A note
- Algebraic properties of \(L\)-fuzzy finite automata
- Algebraic structures of automata
- Automata theory based on complete residuated lattice-valued logic
- Automata theory based on complete residuated lattice-valued logic. II
- Automata theory based on complete residuated lattice-valued logic: Reduction and minimization
- Automata theory based on quantum logic: Some characterizations
- Behaviour, reduction and minimization of finite \({\mathbb{L}}\)-automata
- Bifuzzy core of fuzzy automata
- Characterizations of fuzzy finite automata.
- Construction of a minimal realization and monoid for a fuzzy language: a categorical approach
- Coreflective hull of finite strong L-topological spaces
- Determinization of fuzzy automata with membership values in complete residuated lattices
- FINITE ${\mathbb L}$–FUZZY ACCEPTORS, REGULAR ${\mathbb L}$–FUZZY GRAMMARS AND SYNTACTIC PATTERN RECOGNITION
- Fuzzy acceptors for syntactic pattern recognition
- Fuzzy automata based on lattice-ordered monoid with algebraic and topological aspects
- Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids
- Fuzzy sets
- Fuzzy topological spaces and fuzzy compactness
- Intuitionistic fuzzy finite state machines
- Intuitionistic fuzzy finite switchboard state machines
- Maximin automata
- Metamathematics of fuzzy logic
- Myhill-Nerode type theory for fuzzy languages and automata
- On \((\odot, \operatorname{\&})\)-fuzzy rough sets based on residuated and co-residuated lattices
- On a decomposition of fuzzy automata
- On categories of infinite automata
- On minimal realization for a fuzzy language and Brzozowski's algorithm
- On proper fuzzification of finite state machine
- Pattern recognition using temporal fuzzy automata
- Products of \(T\)-generalized state machines and \(T\)-generalized transformation semigroups
- Quotient structures of intuitionistic fuzzy finite state machines
- Semigroup homomorphisms and fuzzy automata
- Structure and Transition-Preserving Functions of Finite Automata
- The amalgamation of automata
Cited in
(4)
This page was built for publication: Different Operators in Automata Theory Based on Residuated and Co-Residuated Lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874592)