Search results

From MaRDI portal
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • Permutations of Minimal Complexity 2015-11-10 Paper Canonical Representatives of Morphic Permutations 2015-11-04 Paper Subword Complexity and Decomposition of...
    10 bytes (18 words) - 15:17, 9 December 2023
  • Publication Type The Maximal Subword Complexity of Quasiperiodic Infinite Words 2021-02-24 Paper Quasiperiods, Subword Complexity and the Smallest Pisot Number...
    10 bytes (16 words) - 18:12, 6 October 2023
  • Publication Date of Publication Type Subword complexity of uniform D0L words over finite groups 2011-10-10 Paper On the D0L Repetition Threshold 2010-12-01...
    10 bytes (16 words) - 12:04, 6 October 2023
  • Publication Date of Publication Type Subword complexity and finite characteristic numbers 2018-09-18 Paper Subword complexity and Laurent series with coefficients...
    10 bytes (16 words) - 09:00, 7 October 2023
  • the subword complexity of Thue-Morse polynomial extractions 2008-01-07 Paper On the distribution of \binom CnDn modulo p 2007-05-30 Paper On subword decomposition...
    10 bytes (16 words) - 09:45, 24 September 2023
  • problem with several participants 2013-07-29 Paper An improvement of subword complexity 2013-06-06 Paper...
    10 bytes (17 words) - 13:30, 11 December 2023
  • Paper Bounds on the Kolmogorov Complexity Function for Infinite Words 2017-03-31 Paper Quasiperiods, Subword Complexity and the Smallest Pisot Number 2016-12-20...
    10 bytes (17 words) - 00:31, 10 December 2023
  • COMBINATORIAL KNOT INVARIANTS THAT DETECT TREFOILS 2009-11-04 Paper On Subword Complexity of Morphic Sequences 2008-06-05 Paper...
    10 bytes (16 words) - 03:23, 28 December 2023
  • Date of Publication Type Ancestors graph and an upper bound for the subword complexity function 2013-02-19 Paper...
    10 bytes (16 words) - 21:13, 24 September 2023
  • Publication Date of Publication Type On subword complexity functions 1984-01-01 Paper...
    10 bytes (16 words) - 22:28, 22 September 2023
  • Publication Date of Publication Type Subword complexity and projection bodies 2008-03-05 Paper Sequences and filters of characters characterizing subgroups...
    10 bytes (16 words) - 19:00, 6 October 2023
  • de/entity/Q4994947 2021-06-22 Paper Abelian Complexity and Synchronization 2021-05-03 Paper Subword complexity of the Fibonacci-Thue-Morse sequence: the...
    10 bytes (19 words) - 16:09, 6 December 2023
  • https://portal.mardi4nfdi.de/entity/Q3576750 2010-08-02 Paper The subword complexity of a class of infinite binary words 2007-06-29 Paper...
    10 bytes (16 words) - 09:47, 25 September 2023
  • mardi4nfdi.de/entity/Q4934356 2000-01-17 Paper On minimal words with given subword complexity 1998-07-27 Paper...
    10 bytes (17 words) - 16:09, 6 December 2023
  • 2023-04-20 Paper Prime automata do not exist 2022-06-13 Paper The subword complexity of polynomial subsequences of the Thue-Morse sequence 2022-05-31 Paper...
    10 bytes (16 words) - 17:07, 6 October 2023
  • Shuffle invariance of the super-RSK algorithm 2002-09-12 Paper The subword complexity of a two-parameter family of sequences 2001-10-16 Paper...
    10 bytes (16 words) - 22:17, 24 September 2023
  • Paper A note on constructing infinite binary words with polynomial subword complexity 2013-06-18 Paper...
    10 bytes (16 words) - 18:15, 24 September 2023
  • Fluctuation of k-Abelian Complexity 2015-10-20 Paper Subword Complexity and Decomposition of the Set of Factors 2014-10-14 Paper Cyclic Complexity of Words 2014-10-14...
    10 bytes (17 words) - 11:27, 11 December 2023
  • Paper A note on constructing infinite binary words with polynomial subword complexity 2013-06-18 Paper Number of holes in unavoidable sets of partial words...
    10 bytes (16 words) - 09:56, 6 October 2023
  • 1982-01-01 Paper On the subword complexity of DOL languages with a constant distribution 1981-01-01 Paper On the subword complexity of square-free DOL languages...
    10 bytes (17 words) - 22:07, 10 December 2023
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)