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.
@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},
volume = {46},
year = {2012},
pages = {33-50},
doi = {10.1051/ita/2011131},
mrnumber = {2904959},
zbl = {1247.68203},
language = {en},
url = {http://dml.mathdoc.fr/item/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) pp. 33-50. doi : 10.1051/ita/2011131. http://gdmltest.u-ga.fr/item/ITA_2012__46_1_33_0/
[1] and , Efficient string matching: An aid to bibliographic search. Commun. ACM 18 (1975) 333-340. | MR 371172 | Zbl 0301.68048
[2] , and , The Design and Analysis of Computer Algorithms. Addison-Wesley (1974). | MR 413592 | Zbl 0326.68005
[3] and , Partial words and a theorem of Fine and Wilf. Theoret. Comput. Sci. 218 (1999) 135-141. | MR 1687780 | Zbl 0916.68120
[4] , Algorithmic Combinatorics on Partial Words (Discrete Mathematics and Its Applications). Chapman & Hall/CRC (2007). | MR 2384993 | Zbl 1180.68205
[5] and , A fast string searching algorithm. Commun. ACM 20 (1977) 762-772. | Zbl 1219.68165
[6] , and , 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.
[7] and , Text Algorithms. Oxford University Press (1994). | MR 1307378 | Zbl 0844.68101
[8] , and , Algorithms on Strings. Cambridge University Press (2007) 392. | MR 2355493 | Zbl 1137.68060
[9] and , Uniqueness theorems for periodic functions. Proc. of Amer. Math. Soc. 16 (1965) 109-114. | MR 174934 | Zbl 0131.30203
[10] and , String matching and other products. SIAM-AMS Proceedings, Complexity of Computation 7 (1974) 113-125. | MR 400782 | Zbl 0301.68027
[11] , and , Relational codes of words. Theoret. Comput. Sci. 389 (2007) 237-249. | MR 2363375 | Zbl 1143.68036
[12] , and , Fast pattern-matching on indeterminate strings. J. Discrete Algorithms 6 (2008) 37-50. | MR 2397082 | Zbl 1162.68808
[13] , and , Fast pattern matching in strings. SIAM J. Comput. 6 (1977) 323-350. | MR 451916 | Zbl 0372.68005
[14] , and , Subset seed automaton, in Proc. of the 12th International Conference on Implementation and Application of Automata (CIAA). Springer (2007) 180-191. | MR 2595438 | Zbl 1139.68369
[15] , Combinatorics on words. Cambridge University Press (1997). | MR 1475463 | Zbl 0874.20040
[16] and , Counter-free Automata. MIT Press, Cambridge, MA (1971). | MR 371538 | Zbl 0232.94024
[17] , Varieties of Formal Languages. North Oxford, London and Plenum, New-York (1986). | Zbl 0632.68069
[18] , and , 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 2552884
[19] , On finite monoids having only trivial subgroups. Inform. Control 8 (1965) 190-194. | MR 176883 | Zbl 0131.02001