Multiwords are words in which a single symbol can be replaced by a nonempty set of symbols. They extend the notion of partial words. A word w is certain in a multiword M if it occurs in every word that can be obtained by selecting one single symbol among the symbols provided in each position of M. Motivated by a problem on incomplete databases, we investigate a variant of the pattern matching problem which is to decide whether a word w is certain in a multiword M. We study the language CERTAIN(w) of multiwords in which w is certain. We show that this regular language is aperiodic for three large families of words. We also show its aperiodicity in the case of partial words over an alphabet with at least three symbols.
Mots-clés : pattern matching, aperiodicity, partial words
@article{ITA_2012__46_1_33_0, author = {Bruy\`ere, V\'eronique and Carton, Olivier and Decan, Alexandre and Gauwin, Olivier and Wijsen, Jef}, title = {An aperiodicity problem for multiwords}, journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications}, pages = {33--50}, publisher = {EDP-Sciences}, volume = {46}, number = {1}, year = {2012}, doi = {10.1051/ita/2011131}, mrnumber = {2904959}, zbl = {1247.68203}, language = {en}, url = {http://archive.numdam.org/articles/10.1051/ita/2011131/} }
TY - JOUR AU - Bruyère, Véronique AU - Carton, Olivier AU - Decan, Alexandre AU - Gauwin, Olivier AU - Wijsen, Jef TI - An aperiodicity problem for multiwords JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications PY - 2012 SP - 33 EP - 50 VL - 46 IS - 1 PB - EDP-Sciences UR - http://archive.numdam.org/articles/10.1051/ita/2011131/ DO - 10.1051/ita/2011131 LA - en ID - ITA_2012__46_1_33_0 ER -
%0 Journal Article %A Bruyère, Véronique %A Carton, Olivier %A Decan, Alexandre %A Gauwin, Olivier %A Wijsen, Jef %T An aperiodicity problem for multiwords %J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications %D 2012 %P 33-50 %V 46 %N 1 %I EDP-Sciences %U http://archive.numdam.org/articles/10.1051/ita/2011131/ %R 10.1051/ita/2011131 %G en %F ITA_2012__46_1_33_0
Bruyère, Véronique; Carton, Olivier; Decan, Alexandre; Gauwin, Olivier; Wijsen, Jef. An aperiodicity problem for multiwords. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 46 (2012) no. 1, pp. 33-50. doi : 10.1051/ita/2011131. http://archive.numdam.org/articles/10.1051/ita/2011131/
[1] Efficient string matching: An aid to bibliographic search. Commun. ACM 18 (1975) 333-340. | MR | Zbl
and ,[2] The Design and Analysis of Computer Algorithms. Addison-Wesley (1974). | MR | Zbl
, and ,[3] Partial words and a theorem of Fine and Wilf. Theoret. Comput. Sci. 218 (1999) 135-141. | MR | Zbl
and ,[4] Algorithmic Combinatorics on Partial Words (Discrete Mathematics and Its Applications). Chapman & Hall/CRC (2007). | MR | Zbl
,[5] A fast string searching algorithm. Commun. ACM 20 (1977) 762-772. | Zbl
and ,[6] On first-order query rewriting for incomplete database histories, in Proc. of the 16th International Symposium on Temporal Representation and Reasoning (TIME) (2009) 54-61.
, and ,[7] Text Algorithms. Oxford University Press (1994). | MR | Zbl
and ,[8] Algorithms on Strings. Cambridge University Press (2007) 392. | MR | Zbl
, and ,[9] Uniqueness theorems for periodic functions. Proc. of Amer. Math. Soc. 16 (1965) 109-114. | MR | Zbl
and ,[10] String matching and other products. SIAM-AMS Proceedings, Complexity of Computation 7 (1974) 113-125. | MR | Zbl
and ,[11] Relational codes of words. Theoret. Comput. Sci. 389 (2007) 237-249. | MR | Zbl
, and ,[12] Fast pattern-matching on indeterminate strings. J. Discrete Algorithms 6 (2008) 37-50. | MR | Zbl
, and ,[13] Fast pattern matching in strings. SIAM J. Comput. 6 (1977) 323-350. | MR | Zbl
, and ,[14] Subset seed automaton, in Proc. of the 12th International Conference on Implementation and Application of Automata (CIAA). Springer (2007) 180-191. | MR | Zbl
, and ,[15] Combinatorics on words. Cambridge University Press (1997). | MR | Zbl
,[16] Counter-free Automata. MIT Press, Cambridge, MA (1971). | MR | Zbl
and ,[17] Varieties of Formal Languages. North Oxford, London and Plenum, New-York (1986). | Zbl
,[18] Pattern matching in degenerate DNA/RNA sequences, in Workshop on Algorithms and Computation (WALCOM), edited by M. Kaykobad and M.S. Rahman. Bangladesh Academy of Sciences (BAS) (2007) 109-120. | MR
, and ,[19] On finite monoids having only trivial subgroups. Inform. Control 8 (1965) 190-194. | MR | Zbl
,Cité par Sources :