Irreducible ambibuities in monoids of words

MaRDI QIDQ1781922zbMATH OpenFDO

Authors Claude Del Vigna, Vincent Berment

Publication date 9 June 2005

Published in Bulletin of the Belgian Mathematical Society - Simon Stevin (Search for Journal in Brave)

Full work available at URL https://projecteuclid.org/euclid.bbms/1074791326

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Combinatorics on words (68R15)

Recommendations

• scientific article; zbMATH DE number 176924
• Automaticity of primitive words and irreducible polynomials
• scientific article; zbMATH DE number 5155120
• ON LANGUAGES FACTORIZING THE FREE MONOID
• On the word problem for syntactic monoids of piecewise testable languages.

Cited in

(1)

• On braid words and irreflexivity

This page was built for publication: Irreducible ambibuities in monoids of words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1781922)