Pages that link to "Item:Q4404801"
From MaRDI portal
The following pages link to State Reduction in Incompletely Specified Finite-State Machines (Q4404801):
Displaying 17 items.
- Learning regular omega languages (Q329611) (← links)
- Minimization of incompletely specified Mealy finite-state machines by merging two internal states (Q393671) (← links)
- Minimization of power consumption of finite state machines by splitting their internal states (Q499102) (← links)
- Optimal state reductions of automata with partially specified behaviors (Q728283) (← links)
- Automated assumption generation for compositional verification (Q934710) (← links)
- Canonical finite state machines for distributed systems (Q1044846) (← links)
- Minimal coverings for incompletely specified sequential machines (Q1088411) (← links)
- On the control of discrete-event dynamical systems (Q1123861) (← links)
- Space-bounded reducibility among combinatorial problems (Q1221749) (← links)
- Finite \(L\)-fuzzy machines. (Q1426247) (← links)
- Exact complexity of problems of incompletely specified automata (Q1817068) (← links)
- State complexity of binary coded regular languages (Q2112182) (← links)
- Certifying DFA bounds for recognition and separation (Q2147179) (← links)
- Effective reductions of Mealy machines (Q2165218) (← links)
- On Minimization and Learning of Deterministic ω-Automata in the Presence of Don’t Care Words (Q6094518) (← links)
- State complexity of binary coded regular languages (Q6120344) (← links)
- Dissecting \texttt{ltlsynt} (Q6151759) (← links)