Pumping Lemma (Regular) Example

۹۴۱


۱

An example of using the pumping lemma proof to prove a language is NOT regular.

Published by: Josh Beatty
Published at: ۱ year ago
Category: مردم و وبلاگ