State Reduction in Incompletely Specified Finite-State Machines
From MaRDI portal
Publication:4404801
DOI10.1109/T-C.1973.223655zbMath0278.94030OpenAlexW2116861015MaRDI QIDQ4404801
Publication date: 1973
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/t-c.1973.223655
Related Items
Minimal coverings for incompletely specified sequential machines, Certifying DFA bounds for recognition and separation, Learning regular omega languages, Effective reductions of Mealy machines, On the control of discrete-event dynamical systems, Minimization of incompletely specified Mealy finite-state machines by merging two internal states, On Minimization and Learning of Deterministic ω-Automata in the Presence of Don’t Care Words, Dissecting \texttt{ltlsynt}, Finite \(L\)-fuzzy machines., Automated assumption generation for compositional verification, Minimization of power consumption of finite state machines by splitting their internal states, Space-bounded reducibility among combinatorial problems, State complexity of binary coded regular languages, A sufficient condition to polynomially compute a minimum separating DFA, Optimal state reductions of automata with partially specified behaviors, Exact complexity of problems of incompletely specified automata, Canonical finite state machines for distributed systems, State complexity of binary coded regular languages
