For example, using the set of bits { "0", "1" } as "A", the set "N" of all bit strings containing evenly many "1"s is a stable submonoid because if "u" contains an even number of "1"s, and "ux" as well, then "x" must contain an even number of "1"s, too.