On a Factorisation of Free Monoids
From MaRDI portal
Publication:5623900
DOI10.2307/2033993zbMath0219.20039OpenAlexW4236031056WikidataQ29391470 ScholiaQ29391470MaRDI QIDQ5623900
Publication date: 1965
Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2033993
Related Items
New results on Nyldon words and Nyldon-like sets, A new perspective on intermediate algorithms via the Riemann-Hilbert correspondence, Eulerian calculus. II: An extension of Han's fundamental transformation, The origins of combinatorics on words, A completion algorithm for codes with bounded synchronization delay, On the Netto Inversion Number of a Sequence, Unnamed Item, On some properties of very pure codes, On optimal factorization of free semigroups into free subsemigroups, Unnamed Item, Interview with Xavier Viennot, Factorizations of free monoids and unavoidable regularities, Codes limites et factorisations finies du monoïde libre, Unnamed Item, Bisections reconnaissables, Combinatorics of Hall trees and Hall words, \(\mathbb{N}\)-rationality of zeta functions, The free partially commutative Lie algebra: Bases and ranks, The decrease value theorem with an application to permutation statistics, Gröbner–Shirshov bases and their calculation, A combinatorial property of codes having finite synchronization delay, Inverse Lyndon words and inverse Lyndon factorizations of words, On maximal codes with bounded synchronization delay, Generating functions of circular codes, Nyldon words, Signed words and permutations. V: A sextuple distribution, A Combinatorial Proof of Bass’s Evaluations of the Ihara-Selberg Zeta Function for Graphs
