Prove language X regular:
known regular language
X
fop
fop is a “friendly operation” — one that preserves regular languages
Prove language X non-regular:
X
known non-regular language
fop
| Previous slide | Next slide | Back to first slide | View graphic version |