scientific article

zbMath0663.68085MaRDI QIDQ3814828

Antal Iványi

Publication date: 1987

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

complexity measures of symbol sequencessupercomplex strings

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Discrete mathematics in relation to computer science (68R99)

Related Items (13)

Initial non-repetitive complexity of infinite words ⋮ Algorithms for subsequence combinatorics ⋮ Construction of infinite de Bruijn arrays ⋮ Versatile string kernels ⋮ Arithmetical complexity of symmetric D0L words. ⋮ A new complexity function, repetitions in Sturmian words, and irrationality exponents of Sturmian numbers ⋮ Concordance and consensus ⋮ Sequences of linear arithmetical complexity ⋮ On the combinatorics of finite words ⋮ Complexity for finite factors of infinite sequences ⋮ Total palindrome complexity of finite words ⋮ On possible growths of arithmetical complexity ⋮ Maximal state complexity and generalized de Bruijn words

This page was built for publication: