Two-Sided Bounds for the Growth Rates of Power-Free Languages (Q3637248): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-02737-6_38 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W109830933 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential lower bounds for the number of words of uniform length avoiding a pattern / rank
 
Normal rank
Property / cites work
 
Property / cites work: Growth of repetition-free words -- a review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3395963 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniformly growing k-th power-free homomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata and forbidden words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4327350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3254327 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial versus exponential growth in repetition-free binary words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Repetition-free words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3115592 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3659988 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3689370 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparing Complexity Functions of a Language and Its Extendable Part / rank
 
Normal rank
Property / cites work
 
Property / cites work: Growth rates of power-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Complexity of Regular Languages / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:00, 1 July 2024

scientific article
Language Label Description Also known as
English
Two-Sided Bounds for the Growth Rates of Power-Free Languages
scientific article

    Statements

    Identifiers