Construction of fuzzy automata from fuzzy regular expressions
From MaRDI portal
Publication:1759725
DOI10.1016/j.fss.2012.01.007zbMath1253.68209arXiv1105.6190OpenAlexW2171703119MaRDI QIDQ1759725
Aleksandar Stamenković, Miroslav Ćirić
Publication date: 22 November 2012
Published in: Fuzzy Sets and Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1105.6190
fuzzy automataregular expressionslattice-ordered monoidsstate reductionfuzzy regular expressionsposition automatanondeterministic automataright invariant equivalences
Related Items
Pseudovarieties of algebras with fuzzy equalities., Weak bisimulations for fuzzy automata, Ranks of fuzzy matrices. Applications in state reduction of fuzzy automata, Determinization of fuzzy automata by factorizations of fuzzy states and right invariant fuzzy quasi-orders, Introducing synchrony in fuzzy automata, Conversion of fuzzy automata into fuzzy regular expressions using transitive closure, Computation of the greatest simulations and bisimulations between fuzzy automata, A comment on ``Construction of fuzzy automata from fuzzy regular expressions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bisimulations for fuzzy automata
- An improved algorithm for determinization of weighted and fuzzy automata
- Finite automata theory with membership values in lattices
- Partial derivatives of regular expressions and finite automaton constructions
- Computation of the greatest simulations and bisimulations between fuzzy automata
- NFA reduction algorithms by means of regular inequalities
- Reduction of fuzzy automata by means of fuzzy quasi-orders
- Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids
- Congruences and homomorphisms of fuzzy automata
- Regular grammars with truth values in lattice-ordered monoid and their languages
- Weighted finite automata over strong bimonoids
- Pumping lemma in automata theory based on complete residuated lattice-valued logic: a note
- Minimization of states in automata theory based on finite lattice-ordered monoids
- Automata theory based on complete residuated lattice-valued logic
- Automata theory based on complete residuated lattice-valued logic. II
- Nondeterministic automata: equivalence, bisimulations, and uniform relations
- Schützenberger's theorem on formal power series follows from Kleene's theorem
- Computing behavior of finite fuzzy machines -- algorithm and its application to reduction and minimization
- 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
- Determinization of weighted finite automata over strong bimonoids
- 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
- Fuzzy homomorphisms of algebras
- Automata theory based on complete residuated lattice-valued logic: a categorical approach
- Fuzzy sets and systems. Theory and applications
- Fuzzy automata and languages
- On quotient machines of a fuzzy automaton and the minimal machine
- On the existence and construction of \(T\)-transitive closures.
- Follow automata.
- Characterizations of fuzzy finite automata.
- Finite \(L\)-fuzzy machines.
- Minimization algorithm of fuzzy finite automata.
- Reducing NFAs by invariant equivalences.
- Finite nondeterministic automata: simulation and minimality
- Mergible states in large NFA
- Minimization of fuzzy finite automata
- Canonical derivatives, partial derivatives and finite automaton constructions.
- Determinism and fuzzy automata
- Formal power series and regular operations on fuzzy languages
- Fuzzy equivalence relations and their equivalence classes
- Equivalence in automata theory based on complete residuated lattice-valued logic
- Minimization of lattice finite automata and its application to the decomposition of lattice languages
- Determinization of fuzzy automata with membership values in complete residuated lattices
- The relationships among several types of fuzzy automata
- Algebraic properties of \(LA\)-languages
- Max-product machines
- On the definition of a family of automata
- THE ABSTRACT THEORY OF AUTOMATA
- Kleene and Büchi Theorems for Weighted Automata and Multi-valued Logics over Arbitrary Bounded Lattices
- FINITE ${\mathbb L}$–FUZZY ACCEPTORS, REGULAR ${\mathbb L}$–FUZZY GRAMMARS AND SYNTACTIC PATTERN RECOGNITION
- Factorization of Fuzzy Automata
- Lattice Automata
- Programming Techniques: Regular expression search algorithm
- Maximin automata
- A Formulation of Fuzzy Automata and Its Application as a Model of Learning Systems
- On free monoids partially ordered by embedding
- Derivatives of Regular Expressions
- Combinatorial Pattern Matching
- Ordering by Divisibility in Abstract Algebras
- Theory Is Forever
- Fuzzy equational logic
