State Reduction in Incompletely Specified Finite-State Machines

DOI10.1109/T-C.1973.223655MaRDI QIDQ4404801zbMATH OpenOpenAlexFDO

Authors Charles P. Pfleeger

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited in

(19)

• Canonical finite state machines for distributed systems
• Minimal coverings for incompletely specified sequential machines
• On the control of discrete-event dynamical systems
• Space-bounded reducibility among combinatorial problems
• Finite L-fuzzy machines.
• Exact complexity of problems of incompletely specified automata
• State complexity of binary coded regular languages
• Certifying DFA bounds for recognition and separation
• Effective reductions of Mealy machines
• A sufficient condition to polynomially compute a minimum separating DFA
• Learning regular omega languages
• Minimization of incompletely specified Mealy finite-state machines by merging two internal states
• Minimization of power consumption of finite state machines by splitting their internal states
• On Minimization and Learning of Deterministic ω-Automata in the Presence of Don’t Care Words
• State complexity of binary coded regular languages
• Dissecting \texttt{ltlsynt}
• Constructing deterministic parity automata from positive and negative examples
• Optimal state reductions of automata with partially specified behaviors
• Automated assumption generation for compositional verification

This page was built for publication: State Reduction in Incompletely Specified Finite-State Machines

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