On the Subword Complexity of D0L Languages with a Constant Distribution
暂无分享,去创建一个
[1] Andrzej Ehrenfeucht,et al. On Subword Complexities of Homomorphic Images of Languages , 1982, RAIRO Theor. Informatics Appl..
[2] Andrzej Ehrenfeucht,et al. On the Subword Complexity of Square-Free D0L Languages , 1981, Theor. Comput. Sci..
[3] Grzegorz Rozenberg,et al. The mathematical theory of L systems , 1980 .
[4] Jean Berstel,et al. Sur les mots sans carré définis par un morphisme , 1979, ICALP.
[5] Arto Salomaa. Morphisms of free monoids and language theory , 1979 .