The intersection of \(3\)-maximal submonoids

DOI10.1016/j.tcs.2021.11.024OpenAlexW4205167347MaRDI QIDQ2067614

Štěpán Holub, Giuseppa Castiglione

Publication date: 18 January 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2008.01824

zbMATH Keywords

intersection\(3\)-maximal monoidsfree graph

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Uses Software

• Combinatorics_Words

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on intersections of free submonoids of a free monoid
• On binary equality sets and a solution to the test set conjecture in the binary case
• On three-element codes
• Sur la combinatoire des codes à deux mots. (On the combinatorics of two-word codes)
• On the defect theorem and simplifiability
• Sur le théorème du defaut
• Deciding whether a finite set of words has rank at most two
• On the independence of equations in three variables.
• On F-semigroups with three generators
• Binary equality sets are generated by two words
• Many aspects of defect theorems
• On sets of words of rank two
• Binary intersection revisited
• The intersection of free submonoids of a free monoid is free

This page was built for publication: The intersection of \(3\)-maximal submonoids