×

Comparing complexity functions of a language and its extendable part. (English) Zbl 1149.68055

Summary: The 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.

MSC:

68Q45 Formal languages and automata
68R15 Combinatorics on words
PDF BibTeX XML Cite
Full Text: DOI EuDML Link

References:

[1] C. Choffrut and J. Karhumäki, Combinatorics of words, in Handbook of formal languages1, edited by G. Rosenberg, A. Salomaa. Springer, Berlin (1997) 329-438.
[2] D.M. Cvetković, M. Doob and H. Sachs, Spectra of graphs. Theory and applications, 3rd edn. Johann Ambrosius Barth, Heidelberg (1995).
[3] F. D’Alessandro, B. Intrigila and S. Varricchio, On the structure of counting function of sparse context-free languages. Theor. Comput. Sci.356 (2006) 104-117. Zbl1160.68407 · Zbl 1160.68407
[4] A. Ehrenfeucht and G. Rozenberg, A limit theorem for sets of subwords in deterministic TOL languages. Inform. Process. Lett.2 (1973) 70-73. · Zbl 0299.68044
[5] F.R. Gantmacher, Application of the theory of matrices. Interscience, New York (1959). · Zbl 0085.01001
[6] O. Ibarra and B. Ravikumar, On sparseness, ambiguity and other decision problems for acceptors and transducers. Lect. Notes Comput. Sci.210 (1986) 171-179. · Zbl 0605.68080
[7] Y. Kobayashi, Repetition-free words. Theor. Comput. Sci.44 (1986) 175-197. · Zbl 0596.20058
[8] Y. Kobayashi, Enumeration of irreducible binary words. Discrete Appl. Math.20 (1988) 221-232. Zbl0673.68046 · Zbl 0673.68046
[9] A. Lepistö, A characterization of 2+-free words over a binary alphabet. Turku Centre for Computer Science, TUCS Tech. Report 74 (1996).
[10] M. Morse and G.A. Hedlund, Symbolic dynamics. Amer. J. Math.60 (1938) 815-866. · Zbl 0019.33502
[11] A.M. Shur, Combinatorial complexity of rational languages. Discrete Anal. Oper. Res. 112 (2005) 78-99 (Russian). · Zbl 1249.68107
[12] A.M. Shur, On intermediate factorial languages. Turku Centre for Computer Science, TUCS Tech. Report 723 (2005). · Zbl 1187.68303
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.