MCA Semester – II
Subject: 620007 – Theory of Computation
Assignment – 8
Regular Language & Finite Automata
1 | Regular Language |
2 | Regular Expression |
3 | Regular Language & Regular Expression Over Σ |
4 | Finite Automata / |
5 | Transition Table |
6 | Types of State |
7 | Transition Diagram |
8 | Transition Function ( δ ) |
9 | Extended Transition Function ( δ* ) |
10 | String Accepted by FA |
11 | String Rejected by FA |
12 | Regular Language ( In Context of FA) |
13 | Distinguishable String With Respect To Language |
Note: Write all Answers with Example.
0 comments:
Post a Comment