Equivalence, reduction and minimization of finite automata over semirings
From MaRDI portal
Publication:1177166
Recommendations
Cites work
- scientific article; zbMATH DE number 3932372 (Why is no real title available?)
- scientific article; zbMATH DE number 3936531 (Why is no real title available?)
- scientific article; zbMATH DE number 3977185 (Why is no real title available?)
- scientific article; zbMATH DE number 3774850 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 3565190 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3246263 (Why is no real title available?)
- scientific article; zbMATH DE number 3358370 (Why is no real title available?)
- scientific article; zbMATH DE number 3367095 (Why is no real title available?)
- scientific article; zbMATH DE number 3371972 (Why is no real title available?)
- Behaviour, reduction and minimization of finite \({\mathbb{L}}\)-automata
- Equivalence, reduction and minimization of finite fuzzy-automata
- General formulation of sequential machines
- On reductions of maximin machines
- Reduced forms for stochastic sequential machines
- Weighted minimum and maximum operations in fuzzy set theory
Cited in
(24)- Equivalence in automata theory based on complete residuated lattice-valued logic
- Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids
- scientific article; zbMATH DE number 19616 (Why is no real title available?)
- REPRESENTATION OF SEMIAUTOMATA BY CANONICAL WORDS AND EQUIVALENCES
- Minimal and statewise minimal intuitionistic general L-fuzzy automata
- Linear recurring sequences over zero-sum semirings
- The equivalence between fuzzy Mealy and fuzzy Moore machines
- Reduction of a kind of finite-state automata over unitary semirings
- Automata theory based on complete residuated lattice-valued logic: Reduction and minimization
- FROM EQUIVALENCE TO ALMOST-EQUIVALENCE, AND BEYOND: MINIMIZING AUTOMATA WITH ERRORS
- Minimization of states in automata theory based on finite lattice-ordered monoids
- Bisimulation of type 2 for BL-general fuzzy automata
- ADMISSIBLE PARTITION FOR BL-GENERAL FUZZY AUTOMATON
- On the Transition Reduction Problem for Finite Automata
- The relationships among several types of fuzzy automata
- Soft finite state machine
- scientific article; zbMATH DE number 7528980 (Why is no real title available?)
- Infinite fuzzy computations
- scientific article; zbMATH DE number 7561353 (Why is no real title available?)
- Reduction of BL-general L-fuzzy automata
- Towards a unified view of finite automata and semi-Markov flowgraph models
- Finite \(L\)-fuzzy machines.
- Computing behavior of finite fuzzy machines -- algorithm and its application to reduction and minimization
- A categorical approach to lattice-valued fuzzy automata
This page was built for publication: Equivalence, reduction and minimization of finite automata over semirings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1177166)