In mathematics and computer science, the right quotient (or simply quotient) of a formal language L1{\displaystyle L_{1}} with a formal language L2{\displaystyle L_{2}} is the language consisting of strings w such that wx is in L1{\displaystyle L_{1}} for some string x in L2{\displaystyle L_{2}}. In symbols, we write: