Geodesic
Comparing complexity functions of a language and its extendable part
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 42 (2008) no. 3, pp. 647-655

Voir la notice de l'article provenant de la source Numdam

Right (left, two-sided) extendable part of a language consists of all words having infinitely many right (resp. left, two-sided) extensions within the language. We prove that for an arbitrary factorial language each of these parts has the same growth rate of complexity as the language itself. On the other hand, we exhibit a factorial language which grows superpolynomially, while its two-sided extendable part grows only linearly.

DOI : 10.1051/ita:2008021
Classification : 68Q70, 68R15 
@article{ITA_2008__42_3_647_0,
     author = {Shur, Arseny M.},
     title = {Comparing complexity functions of a language and its extendable part},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {647--655},
     publisher = {EDP-Sciences},
     volume = {42},
     number = {3},
     year = {2008},
     doi = {10.1051/ita:2008021},
     mrnumber = {2434040},
     zbl = {1149.68055},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.1051/ita:2008021/}
}
TY  - JOUR
AU  - Shur, Arseny M.
TI  - Comparing complexity functions of a language and its extendable part
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 2008
SP  - 647
EP  - 655
VL  - 42
IS  - 3
PB  - EDP-Sciences
UR  - http://geodesic.mathdoc.fr/articles/10.1051/ita:2008021/
DO  - 10.1051/ita:2008021
LA  - en
ID  - ITA_2008__42_3_647_0
ER  - 
%0 Journal Article
%A Shur, Arseny M.
%T Comparing complexity functions of a language and its extendable part
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 2008
%P 647-655
%V 42
%N 3
%I EDP-Sciences
%U http://geodesic.mathdoc.fr/articles/10.1051/ita:2008021/
%R 10.1051/ita:2008021
%G en
%F ITA_2008__42_3_647_0
Shur, Arseny M. Comparing complexity functions of a language and its extendable part. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 42 (2008) no. 3, pp. 647-655. doi: 10.1051/ita:2008021

Cité par Sources :