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.012zbMath1238.68076OpenAlexW2084815378MaRDI QIDQ413312

Nina Yevtushenko, Iksoon Hwang, 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

zbMATH Keywords

software engineeringdistinguishing sequencenon-observable machinenondeterministic finite-state machine

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item