Minimization of Incompletely Specified Sequential Machines

DOI10.1109/T-C.1975.224137MaRDI QIDQ4083347zbMATH OpenFDO

Authors C. V. S. Kameswara Rao, Nripendra N. Biswas

Publication date 1975

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/T-C.1975.224137

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Switching theory, applications of Boolean algebras to circuits and networks (94C11)

Recommendations

• Minimal coverings for incompletely specified sequential machines
• scientific article; zbMATH DE number 3414211
• A heuristic algorithm for the minimization of incompletely specified finite state machines
• scientific article; zbMATH DE number 1174493
• Minimization algorithms for sequential transducers
• The minimization of a kind of non-deterministic finite automata
• Minimisation of automata
• Minimization theorems and techniques for sequential stochastic machines
• Minimization of incompletely specified Mealy finite-state machines by merging two internal states

Cited in

(8)

• Optimizing the combined automation scheme in the ASIS basis
• A heuristic algorithm for the minimization of incompletely specified finite state machines
• Finite L-fuzzy machines.
• On state reduction of incompletely specified finite state machines
• Minimal coverings for incompletely specified sequential machines
• Limits of exact algorithms for inference of minimum size finite state machines
• Clock conversion in sequential machines and the synthesis of relay networks
• scientific article; zbMATH DE number 3414211 (Why is no real title available?)

This page was built for publication: Minimization of Incompletely Specified Sequential Machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4083347)