1. Allouche, J.-P., Shallit, J.: Automatic Sequences: Theory, Applications, Generalizations. Cambridge University Press (2003)
2. Baader, F., Okhotin, A.: Complexity of language equations with one-sided concatenation and all Boolean operations. In: 20th International Workshop on Unification, UNIF 2006, Seattle, USA, August 11, pp. 59–73 (2006)
3. Culik II, K., Gruska, J., Salomaa, A.: Systolic trellis automata, I and II. International Journal of Computer Mathematics 15, 195–212; 16, 3–22 (1984)
4. Dyer, C.: One-way bounded cellular automata. Information and Control 44, 261–281 (1980)
5. Gruska, J.: Descriptional complexity of context-free languages. In: Mathematical Foundations of Computer Science, MFCS 1973, Strbské Pleso, High Tatras, Czechoslovakia, September 3-8, pp. 71–83 (1973)