Equivalence, reduction and minimization of finite automata over semirings
From MaRDI portal
Publication:1177166
DOI10.1016/0304-3975(91)90377-EzbMath0737.68063MaRDI QIDQ1177166
Publication date: 26 June 1992
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (17)
Equivalence in automata theory based on complete residuated lattice-valued logic ⋮ Infinite fuzzy computations ⋮ The equivalence between fuzzy Mealy and fuzzy Moore machines ⋮ Minimization of states in automata theory based on finite lattice-ordered monoids ⋮ Unnamed Item ⋮ Finite \(L\)-fuzzy machines. ⋮ Soft finite state machine ⋮ Computing behavior of finite fuzzy machines -- algorithm and its application to reduction and minimization ⋮ Linear Recurring Sequences over Zero-Sum Semirings ⋮ Unnamed Item ⋮ A categorical approach to lattice-valued fuzzy automata ⋮ Automata theory based on complete residuated lattice-valued logic: Reduction and minimization ⋮ The relationships among several types of fuzzy automata ⋮ Bisimulation of type 2 for BL-general fuzzy automata ⋮ ADMISSIBLE PARTITION FOR BL-GENERAL FUZZY AUTOMATON ⋮ MINIMAL AND STATEWISE MINIMAL INTUITIONISTIC GENERAL L-FUZZY AUTOMATA ⋮ Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Weighted minimum and maximum operations in fuzzy set theory
- Behaviour, reduction and minimization of finite \({\mathbb{L}}\)-automata
- Equivalence, reduction and minimization of finite fuzzy-automata
- Reduced forms for stochastic sequential machines
- On reductions of maximin machines
- General formulation of sequential machines
This page was built for publication: Equivalence, reduction and minimization of finite automata over semirings
