date: 2024-10-30
title: "TOC-As-2"
status: DONE
author:
- AllenYGY
tags:
- Assignment
- TOC
publish: True
TOC-As-2
Convert the following NFA into an equivalent DFA. (20 pt)
First iteration
Second iteration
Third iteration
Let
Determine whether the following languages over
Assume
By the pumping lemma,
If
If
If
Assume
By the pumping lemma,
If
If
If
Assume
By the pumping lemma,
If
If
If
Since
Therefore, I can construct a NFA that accepts this language.
Are the following languages regular? Prove your answer. (10 pt for each)
Assume
Suppose
By the pumping lemma,
If
If
If
Although
we can not construct a NFA for
Let
Assume
By the pumping lemma,
If
If
If