Constructing partial words with subword complexities not achievable by full words (Q428848): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(5 intermediate revisions by 5 users not shown) | |||
Property / author | |||
Property / author: Q418739 / rank | |||
Property / author | |||
Property / author: Francine Blanchet-Sadri / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68R15 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68Q45 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6049377 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
automata and formal languages | |||
Property / zbMATH Keywords: automata and formal languages / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
combinatorics on words | |||
Property / zbMATH Keywords: combinatorics on words / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
partial words | |||
Property / zbMATH Keywords: partial words / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
subword complexity | |||
Property / zbMATH Keywords: subword complexity / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
polynomial complexity | |||
Property / zbMATH Keywords: polynomial complexity / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
intermediate complexity | |||
Property / zbMATH Keywords: intermediate complexity / rank | |||
Normal rank | |||
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.1016/j.tcs.2012.01.039 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2031089489 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the complexity of infinite sequences / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Automatic Sequences / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Complexity of sequences defined by billiard in the cube / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Rauzy's conjecture on billiards in the cube / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Représentation géométrique de suites de complexité $2n+1$ / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Complexity of trajectories in rectangular billiards / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Billiard complexity in rational polyhedra / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Partial words and a theorem of Fine and Wilf / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algorithmic Combinatorics on Partial Words / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Binary De Bruijn Partial Words with One Hole / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5486009 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Complexity and special factors / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4412109 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Toeplitz words, generalized periodicity and periodically iterated morphisms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Complexity of sequences and dynamical systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The subword complexity of a class of infinite binary words / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Complexity of Toeplitz sequences / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4529547 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hard Counting Problems for Partial Words / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sequences with subword complexity \(2n\) / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 10:00, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Constructing partial words with subword complexities not achievable by full words |
scientific article |
Statements
Constructing partial words with subword complexities not achievable by full words (English)
0 references
25 June 2012
0 references
automata and formal languages
0 references
combinatorics on words
0 references
partial words
0 references
subword complexity
0 references
polynomial complexity
0 references
intermediate complexity
0 references