A heuristic algorithm for the minimization of incompletely specified finite state machines
From MaRDI portal
Publication:1860035
DOI10.1016/S0045-7906(00)00016-1zbMath1006.68580MaRDI QIDQ1860035
Publication date: 20 February 2003
Published in: Computers and Electrical Engineering (Search for Journal in Brave)
Computing methodologies and applications (68U99) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (3)
Transformation of a mealy finite-state machine into a Moore finite-state machine by splitting internal states ⋮ A method for minimizing Moore finite-state machines by merging two states ⋮ Minimization of incompletely specified Mealy finite-state machines by merging two internal states
This page was built for publication: A heuristic algorithm for the minimization of incompletely specified finite state machines
