On the Length of Homing Sequences for Nondeterministic Finite State Machines
From MaRDI portal
Publication:5327497
DOI10.1007/978-3-642-39274-0_20zbMath1298.68146OpenAlexW1871501899MaRDI QIDQ5327497
Natalia Kushik, Nina Yevtushenko
Publication date: 7 August 2013
Published in: Implementation and Application of Automata (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-39274-0_20
Related Items (5)
On the complexity of existence of homing sequences for nondeterministic finite state machines ⋮ Deriving Homing Sequences for Finite State Machines with Timed Guards ⋮ Describing Homing and Distinguishing Sequences for Nondeterministic Finite State Machines via Synchronizing Automata ⋮ The relation between preset distinguishing sequences and synchronizing sequences ⋮ Adaptive experiments for state identification in finite state machines with timeouts
This page was built for publication: On the Length of Homing Sequences for Nondeterministic Finite State Machines
