Search results

From MaRDI portal
View ( | ) (20 | 50 | 100 | 250 | 500)
  • Interval Graphs 2013-08-07 Paper Constructing partial words with subword complexities not achievable by full words 2012-06-25 Paper Binary De Bruijn Partial...
    10 bytes (16 words) - 17:43, 6 October 2023
  • partial words. I. 2012-09-13 Paper Constructing partial words with subword complexities not achievable by full words 2012-06-25 Paper Minimum Number of Holes...
    10 bytes (16 words) - 06:01, 7 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
  • 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
  • quadratically upper bounded growth functions and nonlinearly upper bounded subword complexities 1989-01-01 Paper https://portal.mardi4nfdi.de/entity/Q3726141 1985-01-01...
    10 bytes (17 words) - 00:01, 25 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
  • 2006-10-24 Paper COLLAPSING WORDS: A PROGRESS REPORT 2006-08-14 Paper SUBWORD COMPLEXITY OF PROFINITE WORDS AND SUBGROUPS OF FREE PROFINITE SEMIGROUPS 2006-08-14...
    10 bytes (19 words) - 15:54, 11 December 2023
  • https://portal.mardi4nfdi.de/entity/Q4327360 1995-04-05 Paper Sequences with subword complexity \(2n\) 1995-01-22 Paper Curves with increasing chords 1994-12-12 Paper...
    10 bytes (17 words) - 13:48, 8 December 2023
  • https://portal.mardi4nfdi.de/entity/Q3395998 2009-09-15 Paper Scattered subword complexity of non-primitive words 2009-08-10 Paper Contextual Hypergraph Grammars...
    10 bytes (16 words) - 04:07, 25 September 2023
  • Visit-bounded stack automata 2023-10-30 Paper Space Complexity of Stack Automata Models 2023-08-15 Paper Space Complexity of Stack Automata Models 2022-10-13 Paper...
    10 bytes (18 words) - 18:11, 13 December 2023
  • Paper Undecidability of state complexity 2013-10-22 Paper STATE COMPLEXITY AND APPROXIMATION 2013-01-18 Paper State complexity of union and intersection of...
    10 bytes (17 words) - 19:28, 9 December 2023
  • 2015-03-16 Paper DESCRIPTIONAL COMPLEXITY IN ENCODED BLUM STATIC COMPLEXITY SPACES 2015-02-09 Paper Blum Static Complexity and Encoding Spaces 2013-08-09...
    10 bytes (16 words) - 18:54, 9 December 2023
  • Publication Type Computing maximal Kleene closures that are embeddable in a given subword-closed language 2016-03-10 Paper Computing Maximal Kleene Closures That...
    10 bytes (16 words) - 19:27, 9 December 2023
  • Paper Maximal pattern complexity of higher dimensional words 2010-04-21 Paper Super-stationary set, subword problem and the complexity 2009-12-10 Paper https://portal...
    10 bytes (17 words) - 20:20, 9 December 2023
  • Publication Date of Publication Type Alternating complexity of counting first-order logic for the subword order 2023-03-01 Paper Static and dynamic algorithms...
    10 bytes (16 words) - 15:17, 13 December 2023
  • Kuratowski algebras generated by factor-, subword-, and suffix-free languages 2017-08-31 Paper The Complexity of Languages Resulting from the Concatenation...
    10 bytes (16 words) - 09:35, 7 October 2023
  • Suffix-, Factor-, and Subword-Free Languages Under Star and Complementation 2019-12-10 Paper Kuratowski algebras generated by factor-, subword-, and suffix-free...
    10 bytes (16 words) - 12:54, 7 October 2023
  • 2010-09-20 Paper Generalizations of Parikh mappings 2010-06-07 Paper ON SUBWORD SYMMETRY OF WORDS 2008-11-03 Paper Applied Cryptography and Network Security...
    10 bytes (16 words) - 13:42, 11 December 2023
  • equivalence of words 2010-04-15 Paper SUBWORD OCCURRENCES, PARIKH MATRICES AND LYNDON IMAGES 2010-03-09 Paper COMPARING SUBWORD OCCURRENCES IN BINARY D0L SEQUENCES...
    10 bytes (18 words) - 03:51, 9 December 2023
  • 2018-09-06 Paper Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs (extended abstract) 2018-09-06 Paper Bit Complexity of Computing...
    10 bytes (18 words) - 01:06, 11 December 2023
View ( | ) (20 | 50 | 100 | 250 | 500)