Andrzej Ehrenfeucht, Grzegorz Rozenberg. On the Subword Complexity and Square-Freeness of Formal Languages. In Peter Deussen, editor, Theoretical Computer Science, 5th GI-Conference, Karlsruhe, Germany, March 23-25, 1981, Proceedings. Volume 104 of Lecture Notes in Computer Science, pages 1-4, Springer, 1981.
@inproceedings{EhrenfeuchtR81,
title = {On the Subword Complexity and Square-Freeness of Formal Languages},
author = {Andrzej Ehrenfeucht and Grzegorz Rozenberg},
year = {1981},
researchr = {https://researchr.org/publication/EhrenfeuchtR81},
cites = {0},
citedby = {0},
pages = {1-4},
booktitle = {Theoretical Computer Science, 5th GI-Conference, Karlsruhe, Germany, March 23-25, 1981, Proceedings},
editor = {Peter Deussen},
volume = {104},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-10576-X},
}