scientific article; zbMATH DE number 3350192
From MaRDI portal
zbMath0221.20076MaRDI QIDQ5625457
No author found.
Publication date: 1969
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Sur la combinatoire des codes à deux mots. (On the combinatorics of two-word codes), Structural properties of the string statistics problem, On some equations in free partially commutative monoids, Conjugacy relations of prefix codes, A coarse-grained multicomputer algorithm for the detection of repetitions, On extendibility of unavoidable sets, On primitive words with non-primitive product, Unnamed Item, Counting with rational functions, Unnamed Item, Factorial languages whose growth function is quadratically upper bounded, Primitive sets of words, Finitary codes for biinfinite words, Rational bijection of rational sets, Makanin's algorithm for word equations-two improvements and a generalization, The monoid of queue actions, A family of codes commutatively equivalent to prefix codes, An optimal algorithm for computing the repetitions in a word, On some combinatorial problems in free monoids, Optimal off-line detection of repetitions in a string, If a DOL language is k-power free then it is circular, Non-primitive words of the formpqm, What Is Essential Unification?, A string-matching interpretation of the equation \(x^ m y^ n = z^ p\), Deciding whether a finite set of words has rank at most two, Binary codes that do not preserve primitivity, Solving word equations, Rational relations having a rational trace on each finite intersection of rational relations, Solving word equations, Sequences of words defined by two-way transducers, Equation $$x^iy^jx^k=u^iv^ju^k$$ in Words, A combinatorial property of codes having finite synchronization delay, On pseudoknot-bordered words and their properties, Periodes et repetitions des mots du monoide libre, The intersection of \(3\)-maximal submonoids, On equality up-to constraints over finite trees, context unification, and one-step rewriting, The non-parametrizability of the word equation \(xyz=zvx\): a short proof, Solutions principales et rang d'un système d'équations avec constantes dans le monoide libre, A defect theorem for bi-infinite words., Binary codes that do not preserve primitivity, Periodic character sequences where identifying two characters strictly reduces the period, On Conjugacy of Languages, A test-set fork-power-free binary morphisms
