Search results

From MaRDI portal
View ( | ) (20 | 50 | 100 | 250 | 500)
  • 2010-08-18 Paper Super-stationary set, subword problem and the complexity 2009-12-10 Paper Uniform sets and complexity 2009-12-09 Paper Numeration systems...
    10 bytes (16 words) - 21:15, 24 September 2023
  • SUBBALL COMPLEXITY 2015-12-28 Paper Distribution of integral lattice points in an ellipsoid with a Diophantine center 2015-08-14 Paper Subword complexity...
    10 bytes (17 words) - 13:59, 7 October 2023
  • goodness of \(\{S,a\}\)-EOL forms is decidable 1983-01-01 Paper On the subword complexity of m-free DOL languages 1983-01-01 Paper On regularity of context-free...
    10 bytes (17 words) - 17:58, 9 December 2023
  • Transcendence of \(L(1,\chi_{s})/\Pi\) and automata 2018-05-04 Paper Subword complexity and non-automaticity of certain completely multiplicative functions...
    10 bytes (16 words) - 02:15, 25 September 2023
  • computational complexity of set automata 2017-10-13 Paper On the linear classification of even and odd permutation matrices and the complexity of computing...
    10 bytes (18 words) - 02:26, 11 December 2023
  • 2024-02-28 Paper On polynomial ideals, their complexity, and applications 2022-12-09 Paper The complexity of the coverability, the containment, and the...
    10 bytes (19 words) - 19:48, 24 September 2023
  • Nonterminal Complexity 2023-08-15 Paper CONDITIONAL GRAMMARS WITH RESTRICTIONS BY SYNTACTIC PARAMETERS 2022-12-06 Paper Operational complexity and pumping...
    10 bytes (17 words) - 17:43, 9 December 2023
  • a limit point 2012-10-19 Paper Eulerian entropy and non-repetitive subword complexity 2012-03-13 Paper Constant-norm scrambled sets for hypercyclic operators...
    10 bytes (20 words) - 17:55, 6 October 2023
  • quadratically upper bounded growth functions and nonlinearly upper bounded subword complexities 1989-01-01 Paper https://portal.mardi4nfdi.de/entity/Q3493239 1989-01-01...
    10 bytes (18 words) - 07:33, 13 December 2023
  • Publication Date of Publication Type Existential Definability over the Subword Ordering 2024-01-16 Paper Unboundedness problems for machines with reversal-bounded...
    10 bytes (16 words) - 18:37, 24 September 2023
  • Impartial Game with a Linear Winning Strategy 2001-11-26 Paper The subword complexity of a two-parameter family of sequences 2001-10-16 Paper On the recurrence...
    10 bytes (19 words) - 03:42, 9 December 2023
  • approach to the word problem for \(\omega\)-terms over R 2007-02-26 Paper SUBWORD COMPLEXITY OF PROFINITE WORDS AND SUBGROUPS OF FREE PROFINITE SEMIGROUPS 2006-08-14...
    10 bytes (16 words) - 03:06, 9 December 2023
  • ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY 2011-07-14 Paper Abelian complexity of minimal subshifts 2011-02-09 Paper Optimality of...
    10 bytes (16 words) - 12:19, 11 December 2023
  • $S$-adic developments for subshifts 2022-11-21 Paper A Pansiot-type subword complexity theorem for automorphisms of free groups 2022-08-01 Paper The visual...
    10 bytes (16 words) - 15:50, 6 October 2023
  • beta-dynamical system 2011-10-28 Paper Super-stationary set, subword problem and the complexity 2009-12-10 Paper Periodicity Problem of Substitutions over...
    10 bytes (16 words) - 13:58, 7 October 2023
  • in the four-strand braid group. 2014-09-11 Paper UPPER BOUNDS FOR THE COMPLEXITY OF TORUS KNOT COMPLEMENTS 2013-11-08 Paper Erratum to ``How to read the...
    10 bytes (16 words) - 21:36, 24 September 2023
  • Paper Probabilistic prediction of the complexity of traveling salesman problems based on approximating the complexity distribution from experimental data...
    10 bytes (18 words) - 11:24, 6 October 2023
  • Paper A characterization of eventual periodicity 2015-05-22 Paper Subword complexity and Sturmian colorings of regular trees 2015-04-08 Paper https://portal...
    10 bytes (18 words) - 13:59, 7 October 2023
  • k Symbols and Their Complexity – Part I 2009-01-22 Paper Large Families of Pseudorandom Sequences of k Symbols and Their Complexity – Part II 2009-01-22...
    10 bytes (17 words) - 13:17, 8 December 2023
  • de/entity/Q3654109 2010-01-04 Paper Super-stationary set, subword problem and the complexity 2009-12-10 Paper Gap sequence, Lipschitz equivalence and box...
    10 bytes (16 words) - 00:17, 25 September 2023
View ( | ) (20 | 50 | 100 | 250 | 500)