Tight bound on the length of distinguishing sequences for non-observable nondeterministic finite-state machines with a polynomial number of inputs and outputs

DOI10.1016/J.IPL.2011.12.012zbMATH Open1238.68076OpenAlexW2084815378MaRDI QIDQ413312FDOQ413312

Authors: Iksoon Hwang, Nina Yevtushenko, Ana Cavalli 

Publication date: 4 May 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2011.12.012

Recommendations

• Adaptive distinguishing test cases of nondeterministic finite state machines: test case derivation and length estimation
• Preset and adaptive homing experiments for nondeterministic finite state machines
• On the Length of Homing Sequences for Nondeterministic Finite State Machines
• Describing homing and distinguishing sequences for nondeterministic finite state machines via synchronizing automata
• On the complexity of existence of homing sequences for nondeterministic finite state machines

zbMATH Keywords

software engineeringdistinguishing sequencenon-observable machinenondeterministic finite-state machine

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (5)

• Title not available (Why is that?)
• On the Length of Homing Sequences for Nondeterministic Finite State Machines
• Hardness and inapproximability of minimizing adaptive distinguishing sequences
• Preset and adaptive homing experiments for nondeterministic finite state machines
• Adaptive distinguishing test cases of nondeterministic finite state machines: test case derivation and length estimation

This page was built for publication: Tight bound on the length of distinguishing sequences for non-observable nondeterministic finite-state machines with a polynomial number of inputs and outputs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q413312)