Revision as of 22:16, 11 January 2017 edit 128.189.133.101 (talk) →String substitution ← Previous edit		Revision as of 00:32, 12 January 2017 edit undo 128.189.133.101 (talk) →Syntactic relation Next edit →
Line 157: :<math>\{S/m\ \vert\ m\in M\}</math> is finite. In ~~this~~the case that ''M'' is the monoid of words over some alphabet, ''S'' is then a [[~~recognizable~~regular language]], that is, a language that can be recognized by a [[finite state automaton]]. This is discussed in greater detail in the article on [[syntactic monoid]]s. ==Right cancellation==

String operations: Difference between revisions