Describing Homing and Distinguishing Sequences for Nondeterministic Finite State Machines via Synchronizing Automata

DOI10.1007/978-3-319-22360-5_16zbMath1465.68157OpenAlexW1132524622MaRDI QIDQ2947421

Nina Yevtushenko, Natalia Kushik

Publication date: 23 September 2015

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-22360-5_16

zbMATH Keywords

synchronizing worddistinguishing sequencesynchronizing sequencehoming sequencedistinguishing wordhoming wordnondeterministic finite-state machines

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Deriving Homing Sequences for Finite State Machines with Timed Guards

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of existence of homing sequences for nondeterministic finite state machines
• The relation between preset distinguishing sequences and synchronizing sequences
• A calculus of communicating systems
• In extremal combinatorial problem associated with the bound on the length of a synchronizing word in an automaton
• Synchronizing Automata and the Černý Conjecture
• Preset and Adaptive Homing Experiments for Nondeterministic Finite State Machines
• On the Length of Homing Sequences for Nondeterministic Finite State Machines
• Testing finite-state machines: state identification and verification
• Theory Is Forever