On state reduction of incompletely specified finite state machines

DOI10.1016/j.compeleceng.2006.06.001zbMath1109.68054OpenAlexW2058664275MaRDI QIDQ865721

F. Joel Ferguson, Sezer Gören

Publication date: 20 February 2007

Published in: Computers and Electrical Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.compeleceng.2006.06.001

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Minimal consistent DFA revisited ⋮ Minimization of incompletely specified Mealy finite-state machines by merging two internal states ⋮ Diagnosability of fault patterns with labeled stochastic Petri nets ⋮ A sufficient condition to polynomially compute a minimum separating DFA ⋮ Canonical finite state machines for distributed systems