scientific article; zbMATH DE number 3811868
From MaRDI portal
Publication:3659988
algebras with polynomial identitiesasymptotic properties of wordsautomatacombinatorics on wordsformal languagesfree algebrasfree groupsfree semigroupsLie algebrasnilpotent groups
Thue and Post systems, etc. (03D03) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Research exposition (monographs, survey articles) pertaining to group theory (20-02) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35) Combinatorics on words (68R15) Combinatorial codes (94B25)
Cited in
(only showing first 100 items - show all)- A cyclic binary morphism avoiding abelian fourth powers
- On \(\theta\)-episturmian words
- Palindromic richness
- Overlap-freeness in infinite partial words
- Computation of words satisfying the ``rhythmic oddity property (after Simha Arom's works)
- A class of relations among multiple zeta values
- On smooth sets of integers
- A classification of mahonian maj-inv statistics
- Infinite periodic points of endomorphisms over special confluent rewriting systems
- Twin-roots of words and their properties
- Morphically primitive words
- Asymptotic behavior of beta-integers
- On the Shyr-Yu theorem
- A characterization of regular circular languages generated by marked splicing systems
- Gröbner-Shirshov bases for associative algebras with multiple operators and free Rota-Baxter algebras.
- Balanced words and dynamical systems
- Signed words and permutations. V: A sextuple distribution
- Chen-Fox-Lyndon factorization for words over partially ordered sets
- On graphs of central episturmian words
- The maximal-inversion statistic and pattern-avoiding permutations
- The shuffle algebra on the factors of a word is free
- On the product of square-free words
- On three-element codes
- Structural properties of the string statistics problem
- Rational languages and the Burnside problem
- Systèmes codés. (Coded systems)
- A property of three-element codes
- On morphic generation of regular languages
- On some equations in free partially commutative monoids
- Notes on finitely generated semigroups and pumping conditions for regular languages
- Systèmes entiers d'équations sur un alphabet fini et conjecture d'Ehrenfeucht
- On the defect theorem and simplifiability
- A formula for the determinant of a sum of matrices
- Periodic D0L languages
- Semi-commutations
- Identification of pattern languages from examples and queries
- The Dyck language \(D_ 1^{'*}\) is not generated by any matrix grammar of finite index
- Automata accepting primitive words
- Some stochastic processes in a random permutation
- Theory of traces
- On the length of word chains
- Notes on congruence relations and factor pumping conditions for rational languages
- On recognizable subsets of free partially commutative monoids
- Partially ordered finite monoids and a theorem of I. Simon
- Shuffle of parenthesis systems and Baxter permutations
- Permutation properties and the Fibonacci semigroup
- La reconnaissance des facteurs d'un langage fini dans un texte en temps linéaire. (Recognition of the factors of a finite language in a text in linear time)
- Solvability of the asynchronous ranking problem
- A note on word chains and regular languages
- Caractérisation des ensembles normaux substitutifs. (Characterization of normal substitutional sets)
- The algebra of implicit operations
- Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups
- Factorial languages whose growth function is quadratically upper bounded
- A necessary condition for the rationality of the zeta function of a regular language
- Algebraic and multiple integral identities
- On the descriptive power of special Thue systems
- Shuffle on trajectories: Syntactic constraints
- Inventories of unavoidable languages and the word-extension conjecture
- Topologies for the free monoid
- Automatic average-case analysis of algorithms
- Anti-exceedances in permutation groups
- Finiteness and iteration conditions for semigroups
- Fibonacci morphisms and Sturmian words
- Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays
- Permutation statistics and linear extensions of posets
- Efficient parallel algorithms to test square-freeness and factorize strings
- On generalized zeta functions of formal languages and series
- Trace monoids with some invertible generators: Two decision problems
- Strongly compatible total orders on free monoids
- A hyperoctahedral analogue of the free Lie algebra
- Polynomial operations and hierarchies of concatenation
- Applications of a noncommutative Jacobian matrix
- Languages whose \(n\)-element subsets are codes
- Every binary pattern of length six is avoidable on the two-letter alphabet
- Outfix and infix codes and related classes of languages
- Mahonian statistics on labeled forests
- On noncounting regular classes
- Power of words and recognizability of fixpoints of a substitution
- Rational series with coefficients in a commutative ring
- The free partially commutative Lie algebra: Bases and ranks
- Birthday paradox, coupon collectors, caching algorithms and self- organizing search
- Homomorphisms between Solomon's descent algebras
- On the regularity of languages on a binary alphabet generated by copying systems
- Efficient CRCW-PRAM algorithms for universal substring searching
- An on-line string superprimitivity test
- The shuffle algebra and its derivations
- A note on \(\omega\)-permutable semigroups
- How many squares can a string contain?
- Periodicities on trees
- Unbordered factors of the characteristic sequences of irrational numbers
- A conjecture on continued fractions
- On well quasi orders of free monoids
- On quasi orders of words and the confluence property
- Intertwinings of periodic sequences
- On the combinatorics of finite words
- Lyndon words and singular factors of sturmian words
- Fine and Wilf's theorem for three periods and a generalization of Sturmian words
- Generalized factorizations of words and their algorithmic properties
- Quasiperiodicity and string covering
- Gröbner-Shirshov bases for Lie superalgebras and their universal enveloping algebras
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3659988)