1. Avanzini, M., Moser, G.: Closing the gap between runtime complexity and polytime computability. In: Proceedings of the 21st International Conference on Rewriting Techniques and Applications (RTA 2010). Leibniz International Proceedings in Informatics, vol. 6, pp. 33–48 (2010)
2. Béal, M.-P., Crochemore, M., Mignosi, F., Restivo, A., Sciortino, M.: Computing forbidden words of regular languages. Fundamenta Informaticae 56(1-2), 121–135 (2003)
3. Béal, M.-P., Mignosi, F., Restivo, A., Sciortino, M.: Forbidden words in symbolic dynamics. Advances in Applied Mathematics 25, 163–193 (2000)
4. Beaudry, M., Holzer, M., Niemann, G., Otto, F.: McNaughton families of languages. Theoretical Computer Science 290(3), 1581–1628 (2003)
5. Book, R.: Thue systems as rewriting systems. Journal of Symbolic Computation 3(1-2), 39–68 (1987)