Hostname: page-component-cd9895bd7-dzt6s Total loading time: 0 Render date: 2024-12-27T23:24:02.136Z Has data issue: false hasContentIssue false
  • English
  • Français

Comparing Complexity Functions of a Language and Its Extendable Part

Published online by Cambridge University Press:  03 June 2008

Arseny M. Shur
Arseny M. Shur*
Affiliation:
Ural State University, Ekaterinburg, Russia; [email protected]
Get access

Abstract

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.

Keywords

Type
Research Article
Information
RAIRO - Theoretical Informatics and Applications , Volume 42 , Issue 3: JM'06 , July 2008 , pp. 647 - 655
Copyright
© EDP Sciences, 2008

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

C. Choffrut and J. Karhumäki, Combinatorics of words, in Handbook of formal languages 1, edited by G. Rosenberg, A. Salomaa. Springer, Berlin (1997) 329–438.
D.M. Cvetković, M. Doob and H. Sachs, Spectra of graphs. Theory and applications, 3rd edn. Johann Ambrosius Barth, Heidelberg (1995).
D'Alessandro, F., Intrigila, B. and Varricchio, S., On the structure of counting function of sparse context-free languages. Theor. Comput. Sci. 356 (2006) 104–117. CrossRef
Ehrenfeucht, A. and Rozenberg, G., A limit theorem for sets of subwords in deterministic TOL languages. Inform. Process. Lett. 2 (1973) 70–73. CrossRef
F.R. Gantmacher, Application of the theory of matrices. Interscience, New York (1959).
Ibarra, O. and Ravikumar, B., On sparseness, ambiguity and other decision problems for acceptors and transducers. Lect. Notes Comput. Sci. 210 (1986) 171–179. CrossRef
Kobayashi, Y., Repetition-free words. Theor. Comput. Sci. 44 (1986) 175–197. CrossRef
Kobayashi, Y., Enumeration of irreducible binary words. Discrete Appl. Math. 20 (1988) 221–232. CrossRef
A. Lepistö, A characterization of 2+-free words over a binary alphabet. Turku Centre for Computer Science, TUCS Tech. Report 74 (1996).
Morse, M. and Hedlund, G.A., Symbolic dynamics. Amer. J. Math. 60 (1938) 815–866. CrossRef
Shur, A.M., Combinatorial complexity of rational languages. Discrete Anal. Oper. Res. 1 12 (2005) 78–99 (Russian).
A.M. Shur, On intermediate factorial languages. Turku Centre for Computer Science, TUCS Tech. Report 723 (2005).