Syntactic Monoid
Versandkostenfrei!
Versandfertig in 6-10 Tagen
23,99 €
inkl. MwSt.
PAYBACK Punkte
12 °P sammeln!
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In mathematics and computer science, the syntactic monoid M(L) of a formal language L is the smallest monoid that recognizes the language L. Given S c M of a monoid M, one may define sets that consist of formal left or right inverses of elements in S. These are called quotients, and one may define right or left quotients, depending on which side one is concatenating. The syntactic quotient induces an equivalence relation on M, called the syntactic relation, or syntact...
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In mathematics and computer science, the syntactic monoid M(L) of a formal language L is the smallest monoid that recognizes the language L. Given S c M of a monoid M, one may define sets that consist of formal left or right inverses of elements in S. These are called quotients, and one may define right or left quotients, depending on which side one is concatenating. The syntactic quotient induces an equivalence relation on M, called the syntactic relation, or syntactic equivalence or syntactic congruence (induced by S).
