An Improved Upper Bound for the Length of Preset Distinguishing Sequences of Distinguished Merging Finite State Machines.
Canan GüniçenKemal InanUraz Cengiz TürkerHüsnü YenigünPublished in: ISCIS (2014)
Keyphrases
- finite state machines
- upper bound
- hidden markov models
- lower bound
- fixed length
- finite state automata
- arbitrary length
- model checking
- branch and bound algorithm
- variable length
- finite alphabet
- lower and upper bounds
- digital circuits
- worst case
- error probability
- longest common subsequence
- regular expressions
- biological sequences
- constant factor
- database
- minimum distance
- long sequences
- metadata
- databases