scientific article
From MaRDI portal
Publication:3860007
zbMath0425.20046MaRDI QIDQ3860007
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Free semigroups, generators and relations, word problems (20M05) Artificial intelligence (68T99) Semigroups in automata theory, linguistics, etc. (20M35) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Word problems, etc. in computability and recursion theory (03D40) Word problems (aspects of algebraic structures) (08A50)
Related Items (27)
Square-free words on partially commutative free monoids ⋮ Repetition-free words ⋮ On languages satisfying “interchange Lemma” ⋮ Primitive morphisms ⋮ Applications of an infinite square-free co-CFL ⋮ Estimates in Shirshov height theorem ⋮ Avoidable patterns on two letters ⋮ On the generation of powers by OS schemes ⋮ On the subword complexity of m-free DOL languages ⋮ Automatic sequences in negative bases and proofs of some conjectures of shevelev ⋮ Fixed points avoiding abelian \(k\)-powers ⋮ On the subword complexity of square-free DOL languages ⋮ Sharp characterizations of squarefree morphisms ⋮ If a DOL language is k-power free then it is circular ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Periodicity, repetitions, and orbits of an automatic sequence ⋮ Detecting leftmost maximal periodicities ⋮ On cube-free \(\omega\)-words generated by binary morphisms ⋮ Uniformly growing k-th power-free homomorphisms ⋮ A propos d'une conjecture de F. Dejean sur les répétitions dans les mots ⋮ On the subword complexity of DOL languages with a constant distribution ⋮ On the product of square-free words ⋮ On regularity of languages generated by copying systems ⋮ A characterization of power-free morphisms ⋮ Automates finis et ensembles normaux. (Finite automata and normal sets) ⋮ Sequences generated by infinitely iterated morphisms
This page was built for publication:
