Finite Automata Flashcards
1
Q
Definition of DFA
A
…
2
Q
When a DFA accept?
A
…
3
Q
What is an Extended transition function of DFA?
A
…
4
Q
What is the language accepted by a DFA?
A
…
5
Q
Definition of NFA?
A
…
6
Q
What is an Extended transition function of NFA?
A
…
7
Q
What is the language accepted by an NFA?
A
…
8
Q
How to convert NFA in DFA?
A
…
9
Q
What is a partial DFA? How it can be transformed in a DFA?
A
…
10
Q
Proof L(N)=L(D)
A
….
11
Q
Proof L accepted by DFA iif accepted by NFA
A
…
12
Q
Proof of there exist a NFA N with n+1 states that has no equivalent DFA with less than 2^n states.
A
…
13
Q
Definition of e-closure for a state and for a set of states.
A
…
14
Q
What is an Extended transition function of e-NFA?
A
…
15
Q
What is the language accepted by a e-NFA?
A
…
