Pages that link to "Item:Q300305"
From MaRDI portal
The following pages link to On the complexity of existence of homing sequences for nondeterministic finite state machines (Q300305):
Displaying 5 items.
- 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 complexity of checking the existence and derivation of adaptive synchronizing experiments for deterministic FSMs (Q2398505) (← links)
- Describing Homing and Distinguishing Sequences for Nondeterministic Finite State Machines via Synchronizing Automata (Q2947421) (← links)
- Deriving Homing Sequences for Finite State Machines with Timed Guards (Q5060074) (← links)
- On the Length of Homing Sequences for Nondeterministic Finite State Machines (Q5327497) (← links)