Login / Signup
Tight bound on the length of distinguishing sequences for non-observable nondeterministic Finite-State Machines with a polynomial number of inputs and outputs.
Iksoon Hwang
Nina Yevtushenko
Ana R. Cavalli
Published in:
Inf. Process. Lett. (2012)
Keyphrases
</>
finite state machines
maximum number
lower bound
upper bound
worst case
total length
building blocks
finite state automata
database systems
computational complexity
data model
hidden markov models
fixed length
minimal length