String operations: Difference between revisions

Content deleted Content added
String projection: require citation for those sections that can't be sourced by Hopcroft.Ullman.1979
Line 157:
:<math>\{S/m\ \vert\ m\in M\}</math>
 
is finite. In the case that ''M'' is the monoid of words over some alphabet, ''S'' is then a [[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.{{cn}}
 
==Right cancellation==