Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference40 articles.
1. Adian, S.I., Adjan, S.I, Lennox, J., Wiegold, J.: The Burnside Problem and Identities in Groups. Results in Mathematics and Related Areas, Springer (1979)
2. Alon, N., Grytczuk, J., Hałuszczak, M., Riordan, O.: Nonrepetitive colorings of graphs. Random Structures & Algorithms 21(3-4), 336–346 (2002)
3. Arshon, S.: Démonstration de l’existence des suites asymétriques infinies. Rec. Math. [Mat. Sbornik] N.S. 44(4), 769–779 (June 1937)
4. Bean, D.R., Ehrenfeucht, A., McNulty, G.F.: Avoidable patterns in strings of symbols. Pac. J. Math. 85(2), 261–294 (1979)
5. Blakeley, B., Blanchet-Sadri, F., Gunter, J., Rampersad, N.: On the complexity of deciding avoidability of sets of partial words. In: Diekert, V, Nowotka, D (eds.) Developments in Language Theory, pp. 113–124, Berlin, Heidelberg. Springer Berlin Heidelberg (2009)