Pages that link to "Item:Q5327497"
From MaRDI portal
The following pages link to On the Length of Homing Sequences for Nondeterministic Finite State Machines (Q5327497):
Displaying 7 items.
- On the complexity of existence of homing sequences for nondeterministic finite state machines (Q300305) (← links)
- Tight bound on the length of distinguishing sequences for non-observable nondeterministic finite-state machines with a polynomial number of inputs and outputs (Q413312) (← links)
- The relation between preset distinguishing sequences and synchronizing sequences (Q736851) (← links)
- Adaptive experiments for state identification in finite state machines with timeouts (Q2104144) (← links)
- Describing Homing and Distinguishing Sequences for Nondeterministic Finite State Machines via Synchronizing Automata (Q2947421) (← links)
- Homing vector automata (Q2969985) (← links)
- Deriving Homing Sequences for Finite State Machines with Timed Guards (Q5060074) (← links)