Tight bound on the length of distinguishing sequences for non-observable nondeterministic finite-state machines with a polynomial number of inputs and outputs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Information Processing Letters Année : 2012

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

Résumé

In this paper we show that the upper bound 2n - 2 on the length of input sequences that distinguish two sets of states is tight for a non-observable NFSM with n states and a polynomial number of inputs and outputs. For each n>=2, there exists a non-observable NFSM M with n states, a single input symbol, and n output symbols such that there are two sets of states in M which are not distinguishable by each input sequence of length 2n - 3 but can be distinguished by an input sequence of length 2n - 2.

Dates et versions

hal-00711769 , version 1 (25-06-2012)

Identifiants

Citer

Iksoon Hwang, Nina Yevtushenko, Ana Rosa Cavalli. Tight bound on the length of distinguishing sequences for non-observable nondeterministic finite-state machines with a polynomial number of inputs and outputs. Information Processing Letters, 2012, 112 (7), pp.298-301. ⟨10.1016/j.ipl.2011.12.012⟩. ⟨hal-00711769⟩
31 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More