String-matching with OBDD's - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Theoretical Computer Science Année : 2004

String-matching with OBDD's

Résumé

Ordered binary decision diagrams (OBDDs) are a very popular graph representation for Boolean functions. They can be viewed as finite automata recognizing sets of strings of a fixed length, where the letters of the input strings are read at most once in a predefined ordering. The string matching problem with string w as pattern, consists of determining, given an input string, whether or not it contains w as substring. We show that for a fraction of orderings tending to 1 when n increases arbitrarily, the minimal size of an OBDD solving the string matching problem for strings of length n has a growth which is an exponential in n.

Dates et versions

hal-00158278 , version 1 (28-06-2007)

Identifiants

Citer

Christian Choffrut, Yael Haddad. String-matching with OBDD's. Theoretical Computer Science, 2004, 320 (2-3), pp.187-198. ⟨10.1016/j.tcs.2003.11.023⟩. ⟨hal-00158278⟩
39 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More