Factorizations of free monoids and unavoidable regularities
From MaRDI portal
DOI10.1016/0304-3975(90)90163-CzbMATH Open0695.68057OpenAlexW1981855662WikidataQ114214847 ScholiaQ114214847MaRDI QIDQ910247FDOQ910247
Authors: Stefano Varricchio 
Publication date: 1990
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(90)90163-c
Recommendations
Enumerative combinatorics (05A99) Formal languages and automata (68Q45) Rings with polynomial identity (16Rxx)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- An interesting combinatorial method in the theory of locally finite semigroups
- On a Factorisation of Free Monoids
- Title not available (Why is that?)
- Title not available (Why is that?)
- Codes limites et factorisations finies du monoïde libre
- Title not available (Why is that?)
Cited In (13)
- Some decidable congruences of free monoids
- Unambiguous erasing morphisms in free monoids
- Title not available (Why is that?)
- On some factorizations of infinite words by elements of codes
- Defining Relations and the Algebraic Structure of the Group SL2 over Integral Hamilton Quaternions
- On factorization forests of finite height
- Shirshov's theorem and \(\omega\)-permutability of semigroups
- Viennot factorization of infinite words
- Stefano Varricchio (1960-2008)
- Title not available (Why is that?)
- Some combinatorial properties of infinite words and applications to semigroup theory
- A Tale of Two Monoids: A Friendly Introduction to Nonunique Factorizations
- A note on \(\omega\)-permutable semigroups
This page was built for publication: Factorizations of free monoids and unavoidable regularities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q910247)
