Equivalence, reduction and minimization of finite automata over semirings

DOI10.1016/0304-3975(91)90377-EzbMATH Open0737.68063MaRDI QIDQ1177166FDOQ1177166

Authors: Kety Peeva 

Publication date: 26 June 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

Recommendations

• Reduction of a kind of finite-state automata over unitary semirings
• Behaviour, reduction and minimization of finite \({\mathbb{L}}\)-automata
• scientific article; zbMATH DE number 4028907
• Minimization of fuzzy finite automata
• Finite automata

zbMATH Keywords

minimizationequivalencefinite automatareduction

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Weighted minimum and maximum operations in fuzzy set theory
• Reduced forms for stochastic sequential machines
• Behaviour, reduction and minimization of finite \({\mathbb{L}}\)-automata
• On reductions of maximin machines
• Title not available (Why is that?)
• Equivalence, reduction and minimization of finite fuzzy-automata
• General formulation of sequential machines
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (24)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Linear recurring sequences over zero-sum semirings
• Reduction of a kind of finite-state automata over unitary semirings
• ADMISSIBLE PARTITION FOR BL-GENERAL FUZZY AUTOMATON
• Soft finite state machine
• Towards a unified view of finite automata and semi-Markov flowgraph models
• Title not available (Why is that?)
• Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids
• The equivalence between fuzzy Mealy and fuzzy Moore machines
• Minimization of states in automata theory based on finite lattice-ordered monoids
• On the Transition Reduction Problem for Finite Automata
• Computing behavior of finite fuzzy machines -- algorithm and its application to reduction and minimization
• Automata theory based on complete residuated lattice-valued logic: Reduction and minimization
• Bisimulation of type 2 for BL-general fuzzy automata
• Finite \(L\)-fuzzy machines.
• Infinite fuzzy computations
• Title not available (Why is that?)
• REPRESENTATION OF SEMIAUTOMATA BY CANONICAL WORDS AND EQUIVALENCES
• Equivalence in automata theory based on complete residuated lattice-valued logic
• Minimal and statewise minimal intuitionistic general L-fuzzy automata
• A categorical approach to lattice-valued fuzzy automata
• The relationships among several types of fuzzy automata
• FROM EQUIVALENCE TO ALMOST-EQUIVALENCE, AND BEYOND: MINIMIZING AUTOMATA WITH ERRORS

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)