Preset and Adaptive Homing Experiments for Nondeterministic Finite State Machines

DOI10.1007/978-3-642-22256-6_20zbMath1297.68147OpenAlexW41995358MaRDI QIDQ5200066

Khaled El-Fakih, Nina Yevtushenko, Natalia Kushik

Publication date: 29 July 2011

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-22256-6_20

zbMATH Keywords

nondeterministic finite state machinespreset and adaptive homing experiments

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (7)

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 ⋮ Adaptive distinguishing test cases of nondeterministic finite state machines: test case derivation and length estimation ⋮ Hardness and inapproximability of minimizing adaptive distinguishing sequences ⋮ The relation between preset distinguishing sequences and synchronizing sequences ⋮ Adaptive experiments for state identification in finite state machines with timeouts

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rank of a finite automaton
• On the Length of the Smallest Uniform Experiment which Distinguishes the Terminal States of a Machine
• State-identification experiments in finite automata
• Least Upper Bounds on Minimal Terminal State Experiments for Two Classes of Sequential Machines

This page was built for publication: Preset and Adaptive Homing Experiments for Nondeterministic Finite State Machines