Abstract
Given a (finite or infinite) subset X of the free monoid \(A^*\) over a finite alphabet A, the rank of X is the minimal cardinality of a set F such that \(X \subseteq F^*\). A submonoid M generated by k elements of \(A^*\) is k-maximal if there does not exist another submonoid generated by at most k words containing M. We call a set \(X \subseteq A^*\) primitive if it is the basis of a |X|-maximal submonoid. This extends the notion of primitive word: indeed, \(\{w\}\) is a primitive set if and only if w is a primitive word. By definition, for any set X, there exists a primitive set Y such that \(X \subseteq Y^*\). The set Y is therefore called a primitive root of X. As a main result, we prove that if a set has rank 2, then it has a unique primitive root. This result cannot be extended to sets of rank larger than 2.
For a single word w, we say that the set \(\{x,y\}\) is a binary root of w if w can be written as a concatenation of copies of x and y and \(\{x,y\}\) is a primitive set. We prove that every primitive word w has at most one binary root \(\{x,y\}\) such that \(|x|+|y|<\sqrt{|w|}\). That is, the binary root of a word is unique provided the length of the word is sufficiently large with respect to the size of the root.
Our results are also compared to previous approaches that investigate pseudo-repetitions, where a morphic involutive function \(\theta \) is defined on \(A^*\). In this setting, the notions of \(\theta \)-power, \(\theta \)-primitive and \(\theta \)-root are defined, and it is shown that any word has a unique \(\theta \)-primitive root. This result can be obtained with our approach by showing that a word w is \(\theta \)-primitive if and only if \(\{w, \theta (w)\}\) is a primitive set.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Berstel, J., Perrin, D., Perrot, J.F., Restivo, A.: Sur le théorème du défaut. J. Algebra 60(1), 169–180 (1979)
Berstel, J., Perrin, D., Reutenauer, C.: Codes and Automata (Encyclopedia of Mathematics and Its Applications), 1st edn. Cambridge University Press, New York (2009)
Cassaigne, J.: Motifs évitables et régularités dans les mots. Ph.D. thesis, Université Paris VI (1994)
Czeizler, E., Kari, L., Seki, S.: On a special class of primitive words. Theoret. Comput. Sci. 411(3), 617–630 (2010)
Gawrychowski, P., Manea, F., Mercas, R., Nowotka, D.: Hide and seek with repetitions. J. Comput. Syst. Sci. 101, 42–67 (2019)
Gawrychowski, P., Manea, F., Mercas, R., Nowotka, D., Tiseanu, C.: Finding pseudo-repetitions. In: Portier, N., Wilke, T. (eds.) STACS 2013, Proceedings. LIPIcs, vol. 20, pp. 257–268. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2013)
Gawrychowski, P., Manea, F., Nowotka, D.: Discovering hidden repetitions in words. In: Bonizzoni, P., Brattka, V., Löwe, B. (eds.) CiE 2013. LNCS, vol. 7921, pp. 210–219. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-39053-1_24
Harju, T., Karhumäki, J.: On the defect theorem and simplifiability. Semigroup Forum 33(1), 199–217 (1986)
Harju, T., Karhumäki, J.: Many aspects of defect theorems. Theoret. Comput. Sci. 324(1), 35–54 (2004)
Karhumäki, J.: A note on intersections of free submonoids of a free monoid. Semigroup Forum 29(1), 183–205 (1984)
Kari, L., Masson, B., Seki, S.: Properties of pseudo-primitive words and their applications. Int. J. Found. Comput. Sci. 22(2), 447–471 (2011)
Le Rest, E.B., Le Rest, M.: Sur la combinatoire des codes à deux mots. Theoret. Comput. Sci. 41(C), 61–80 (1985)
Lentin, A., Schützenberger, M.: A combinatorial problem in the theory of free monoids. In: Proceedings of the University of North Carolina, pp. 128–144 (1967)
Lothaire, M.: Combinatorics on Words. Addison-Wesley, Boston (1983)
Lothaire, M.: Algebraic Combinatorics on Words. Cambridge University Press, Cambridge (2002)
Néraud, J.: Elementariness of a finite set of words is co-NP-complete. ITA 24, 459–470 (1990)
Néraud, J.: Deciding whether a finite set of words has rank at most two. Theoret. Comput. Sci. 112(2), 311–337 (1993)
Néraud, J.: On the rank of the subsets of a free monoid. Theoret. Comput. Sci. 99(2), 231–241 (1992)
Restivo, A.: On a question of McNaughton and Papert. Inf. Control 25(1), 93–101 (1974)
Tilson, B.: The intersection of free submonoids of a free monoid is free. Semigroup Forum 4(1), 345–350 (1972)
Acknowledgments
We thank Štěpán Holub for useful discussions and in particular for suggesting us the important Example 16.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Castiglione, G., Fici, G., Restivo, A. (2019). On Sets of Words of Rank Two. In: Mercaş, R., Reidenbach, D. (eds) Combinatorics on Words. WORDS 2019. Lecture Notes in Computer Science(), vol 11682. Springer, Cham. https://doi.org/10.1007/978-3-030-28796-2_3
Download citation
DOI: https://doi.org/10.1007/978-3-030-28796-2_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-28795-5
Online ISBN: 978-3-030-28796-2
eBook Packages: Computer ScienceComputer Science (R0)