%0 Conference Paper %1 conf/tcs/EhrenfeuchtR81 %A Ehrenfeucht, Andrzej %A Rozenberg, Grzegorz %B Theoretical Computer Science %D 1981 %E Deussen, Peter %I Springer %K dblp %P 1-4 %T On the Subword Complexity and Square-Freeness of Formal Languages. %U http://dblp.uni-trier.de/db/conf/tcs/tcs1981.html#EhrenfeuchtR81 %V 104 %@ 3-540-10576-X

@inproceedings{conf/tcs/EhrenfeuchtR81, added-at = {2017-05-19T00:00:00.000+0200}, author = {Ehrenfeucht, Andrzej and Rozenberg, Grzegorz}, biburl = {https://www.bibsonomy.org/bibtex/208fe465eba37f2adfa8ccb87271b1fb6/dblp}, booktitle = {Theoretical Computer Science}, crossref = {conf/tcs/1981}, editor = {Deussen, Peter}, ee = {https://doi.org/10.1007/BFb0017289}, interhash = {1a7eac036d824ce3e6549db2a6ea89cb}, intrahash = {08fe465eba37f2adfa8ccb87271b1fb6}, isbn = {3-540-10576-X}, keywords = {dblp}, pages = {1-4}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-05-15T19:39:37.000+0200}, title = {On the Subword Complexity and Square-Freeness of Formal Languages.}, url = {http://dblp.uni-trier.de/db/conf/tcs/tcs1981.html#EhrenfeuchtR81}, volume = 104, year = 1981 }