Comparing Complexity Functions of a Language and Its Extendable Part
@article{Shur2008ComparingCF,
title={Comparing Complexity Functions of a Language and Its Extendable Part},
author={Arseny M. Shur},
journal={RAIRO Theor. Informatics Appl.},
year={2008},
volume={42},
pages={647-655}
}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.
Figures from this paper
18 Citations
Growth of Power-Free Languages over Large Alphabets
- Mathematics, Computer ScienceTheory of Computing Systems
- 2013
Asymptotic formulas for this function α(k,β), whose values are the exponential growth rates of β-power-free languages over k-letter alphabets, are proved and suggested on the base of some partial results.
Two-Sided Bounds for the Growth Rates of Power-Free Languages
- Computer ScienceDevelopments in Language Theory
- 2009
The growth properties of power-free languages over finite alphabets are studied. A method to obtain sharp two-sided bounds of the growth rate of β-power-free languages for arbitrary rational number β…
On the growth rates of complexity of threshold languages
- Computer ScienceRAIRO Theor. Informatics Appl.
- 2010
Threshold languages, which are the (k/k-1)) + -free languages over k-letter alphabets with k > 5, are the minimal infinite power-free languages according to Dejean's conjecture, which is now proved…
Combinatorial Characterization of Formal Languages
- Computer ScienceArXiv
- 2010
This paper is an extended abstract of the dissertation presented by the author for the doctoral degree in physics and mathematics (in Russia), which is a "counting" function associated with a language and returning the number of words of given length in this language.
On Pansiot Words Avoiding 3-Repetitions
- Computer ScienceWORDS
- 2011
It is proved that, as k approaches infinity, the growth rates of complexity for these regular languages tend to the growth rate of complexity of some ternary 2-dimensional language.
A new hierarchy for automaton semigroups
- Mathematics, Computer ScienceCIAA
- 2018
This work defines a new strict and computable hierarchy for the family of automaton semigroups, which reflects the various asymptotic behaviors of the state-activity growth, and proves that the Order Problem is still decidable for the first two levels of this alternative hierarchy.
Finding lower bounds on the growth and entropy of subshifts over countable groups
- Computer Science
- 2022
We give a lower bound on the growth of a subshift based on a simple condition on the set of forbidden patterns defining that subshift. Aubrun et Al. showed a similar result based on the Lov´asz Local…
Binary patterns in binary cube-free words: Avoidability and growth
- Computer ScienceRAIRO Theor. Informatics Appl.
- 2014
All avoidable patterns are shown to be D0L-avoidable, and a new example of a pattern-avoiding language of polynomial growth is given.
References
SHOWING 1-10 OF 12 REFERENCES
On the structure of the counting function of sparse context-free languages
- Computer ScienceTheor. Comput. Sci.
- 2006
On Sparseness, Ambiguity and other Decision Problems for Acceptors and Transducers
- Computer ScienceSTACS
- 1986
This work considers some decision problems on sparseness, degrees of ambiguity and multiple valuedness concerning finite-state and pushdown acceptors and transducers and shows that they are decidable for finite- state devices.
Combinatorics on Words
- Computer Science, Mathematics
- 2004
Words (strings of symbols) are fundamental in computer processing, and nearly all computer software use algorithms on strings.
A Limit Theorem for Sets of Subwords in Deterministic T0L Languages
- MathematicsInf. Process. Lett.
- 1973