scientific article; zbMATH DE number 1024080
From MaRDI portal
Publication:4341774
zbMath0874.20040MaRDI QIDQ4341774
Publication date: 18 June 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
automatafree semigroupsnilpotent groupsLie algebrasalgebras with polynomial identitiesfree algebrasformal languagesfree monoidscombinatorics on wordsasymptotic properties of words
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Combinatorics on words (68R15) Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35) Combinatorial codes (94B25) Thue and Post systems, etc. (03D03) Research exposition (monographs, survey articles) pertaining to group theory (20-02)
Related Items (only showing first 100 items - show all)
New results on Nyldon words and Nyldon-like sets ⋮ Sufficient conditions for the marked graph realisability of labelled transition systems ⋮ Clusters of repetition roots: single chains ⋮ Morphic sequences versus automatic sequences ⋮ Lyndon words formalized in Isabelle/HOL ⋮ A ternary square-free sequence avoiding factors equivalent to \(abcacba\) ⋮ Finding the leftmost critical factorization on unordered alphabet ⋮ Lyndon + Christoffel = digitally convex ⋮ Classification of eventually periodic subshifts ⋮ Generalized Pascal triangle for binomial coefficients of words ⋮ Perfect necklaces ⋮ Leaf realization problem, caterpillar graphs and prefix normal words ⋮ Avoidance bases for formulas with reversal ⋮ The quaternionic weighted zeta function of a graph ⋮ Several extensions of the Parikh matrix \(L\)-morphism ⋮ Longest common subsequence problem for unoriented and cyclic strings ⋮ The origins of combinatorics on words ⋮ Zero-measure Cantor spectrum for Schrödinger operators with low-complexity potentials ⋮ Definability in the structure of words with the inclusion relation ⋮ Equivalence of simple functions ⋮ On a generalization of abelian equivalence and complexity of infinite words ⋮ Abelian-primitive partial words ⋮ Tree shuffle ⋮ A linear partitioning algorithm for hybrid Lyndons using \(V\)-order ⋮ The total run length of a word ⋮ Combinatorial properties of double square tiles ⋮ Regular languages and partial commutations ⋮ Lyndon words and Fibonacci numbers ⋮ Linear computation of unbordered conjugate on unordered alphabet ⋮ Infinite words containing the minimal number of repetitions ⋮ Computing the partial word avoidability indices of binary patterns ⋮ Computing the partial word avoidability indices of ternary patterns ⋮ A generalization of de Bruijn graphs and classification of endomorphisms of Cuntz algebras by graph invariants ⋮ On the maximality of languages with combined types of code properties ⋮ A presentation by generators and relations of Nichols algebras of diagonal type and convex orders on root systems. ⋮ Biinfinite words with maximal recurrent unbordered factors. ⋮ The three squares lemma revisited ⋮ The \((1-\mathbb{E})\)-transform in combinatorial Hopf algebras ⋮ A parallelogram tile fills the plane by translation in at most two distinct ways ⋮ Two infinite families of polyominoes that tile the plane by translation in two distinct ways ⋮ Periodicity algorithms and a conjecture on overlaps in partial words ⋮ Recent results on syntactic groups of prefix codes. ⋮ Avoiding Abelian squares in partial words ⋮ Algorithmic complexity of protein identification: Combinatorics of weighted strings ⋮ Fewest repetitions versus maximal-exponent powers in infinite binary words ⋮ Graph connectivity, partial words, and a theorem of Fine and Wilf ⋮ Composition-diamond lemma for associative conformal algebras. ⋮ Some kinds of primitive and non-primitive words ⋮ On generating binary words palindromically ⋮ Reconstruction of a word from a multiset of its factors ⋮ The pseudopalindromic completion of regular languages ⋮ Finite automata for testing composition-based reconstructibility of sequences ⋮ An algorithmic toolbox for periodic partial words ⋮ Substitutions on two letters, cutting segments and their projections ⋮ An algorithm for enumerating all infinite repetitions in a D0L-system ⋮ Square-free shuffles of words ⋮ Another generalization of abelian equivalence: binomial complexity of infinite words ⋮ Palindromic sequences generated from marked morphisms ⋮ The quaternionic second weighted zeta function of a graph and the Study determinant ⋮ New identities in dendriform algebras ⋮ Relations on words ⋮ Binary block order Rouen transform ⋮ Two fast constructions of compact representations of binary words with given set of periods ⋮ On the density of Lyndon roots in factors ⋮ Multiplicity of positive periodic solutions in the superlinear indefinite case via coincidence degree ⋮ Counting the number of non-zero coefficients in rows of generalized Pascal triangles ⋮ Deciding game invariance ⋮ Solutions to the multi-dimensional Prouhet-Tarry-Escott problem resulting from composition of balanced morphisms ⋮ Behavior of digital sequences through exotic numeration systems ⋮ Languages with membership determined by single letter factors ⋮ Disjunctivity and other properties of sets of pseudo-bordered words ⋮ Dependence with complete connections and the Gauss-Kuzmin theorem for \(N\)-continued fractions ⋮ Representations of Khovanov-Lauda-Rouquier algebras and combinatorics of Lyndon words. ⋮ Higher-order matching polynomials and \(d\)-orthogonality ⋮ Extensions and restrictions of Wythoff's game preserving its \(\mathcal P\) positions ⋮ Quantum quasi-shuffle algebras. ⋮ Equations on palindromes and circular words ⋮ Spiraling and folding: the word view ⋮ Avoiding large squares in partial words ⋮ The formal series Witt transform ⋮ Border correlations of partial words ⋮ On Christoffel and standard words and their derivatives ⋮ On uniformly continuous functions for some profinite topologies ⋮ The extended equation of Lyndon and Schützenberger ⋮ On the tiling by translation problem ⋮ A generalization of Thue freeness for partial words ⋮ On structural properties of eta-expansions of identity ⋮ On finitely generated idempotent semigroups. ⋮ Intersecting periodic words ⋮ On highly palindromic words ⋮ Two linear-time algorithms for computing the minimum length polygon of a digital contour ⋮ Avoidable binary patterns in partial words ⋮ A characterization of rational D0L power series ⋮ Long cycles in \(abc\)-permutations ⋮ Primitive partial permutation representations of the polycyclic monoids and branching function systems. ⋮ Gauss sums, Jacobi sums, and \(p\)-ranks of cyclic difference sets ⋮ Some results on \(k\)-power-free morphisms ⋮ Quantum evolution of words ⋮ Avoidability index for binary patterns with reversal ⋮ Transitive sofic spacing shifts
This page was built for publication:
