Non-Trivial Language
Defined Inductively
l
L = {ab, abab, aabb, aababb,
É
}
l
Basis: ab is in L.
l
Inductive rules:
l
If x is in L, so is axb.
l
If x
1
and x
2
are in L, so is x
1
x
2
.