Flipped Class Room video 1
Finite Automata
Overview
A finite automaton (FA) is a simple idealized machine used to recognize patterns within input taken from some character set (or alphabet) C. The job of an FA is to accept or reject an input depending on whether the pattern defined by the FA occurs in the input. A finite automaton consists of:
- a finite set S of N states
- a special start state
- a set of final (or accepting) states
- a set of transitions T from one state to another, labeled with chars in C
As noted above, we can represent a FA graphically, with nodes for states, and arcs for transitions.
We execute our FA on an input sequence as follows:
- Begin in the start state
- If the next input char matches the label on a transition from the current state to a new state, go to that new state
- Continue making transitions on each input char
- If no move is possible, then stop
- If in accepting state, then accept
Preparation
Flipped Class Room Activity: Students will watch some given videos before coming to the class. In class they have to solve problems based on the concept given in videos. There are two flipped class room activities.
Problem Solving
Afetr watching the video students have to solve some problems on NFA and DFA
Learning Objective
| Assessment Strategy
| Expected duration (in min) | Additional Instructions (if any)
|
NFA Construction
| 1.Write an NFA to recognize strings in { a, b, c}* having ‘a’ as third last symbol | 5 min | WATCH VIDEO V2
|
NFA TO DFA CONVERSION
| 2. Convert the following NFA to a DFA δ 0 1 →p { p, q} {p} q {r} {r} r {s} Ф *s {s} {s}
| 10 min | WATCH VIDEO V2
|
Problem Solving
Watch the given video in resource library and solve the following problems
Learning Objective
| Assessment Strategy
| Expected duration (in min) | Additional Instructions (if any)
|
DFA Construction
| 1.Construct a DFA to accept the language L={awa| where ∑= {a ,b}}
| 5 min | WATCH VIDEO V1
|
| 2. Design a DFA of strings which ends with 'ab‘ where ∑={a ,b}
| 5 min | WATCH VIDEO V1
|
Assessment
After completion of class attend the test on multiple choice questions
Atend all the questions
1. Number of states of the FSM required to simulate behavior of the computer with memory capable of storing “m” words each of length “n”
A. 2m
B. 2mn
C. 2m+n
D. M*2n
2. An FSM with
A. One stack more powerful than no stack
B. 2 stack more powerful than one stack
C. Both A & B
D. None of the above
3. If two finite state machines are isomorphic then
A. M can be transferred to N merely relabeling its state
B. M can be transferred to N merely relabeling its edges
C. Both A & B
D. None of the above
4. Power of
A. DFSM and NDFSM are same
B. DFSM and NDFSM are different
C. DPDM and NDPDM are same
D. DPDM and NDPDM are different
5. There are ________ tuples in finite state machine.
A. 4
B. 5
C. 6
D.unlimited
6. Transition function maps.
A. Σ * Q -> Σ
B. Q * Q -> Σ
C. Σ * Σ -> Q
D.Q * Σ -> Q
7. Languages of a automata is
A. If it is accepted by automata
B. If it halts
C. If automata touch final state in its life time
D. All language are language of automata
8. Language of finite automata is.
A. Type 0
B. Type 1
C. Type 2
D. Type 3
9. Finite automata requires minimum _______ number of stacks.
A. 1
B. 0
C. 2
D. None of the mentioned
10. The basic limitation of finite automata is that
A. It can’t remember arbitrary large amount of information.
B. It sometimes recognize grammar that are not regular.
C.It sometimes fails to recognize regular grammar.
D.All of the mentioned