vu cs601 Mid Term Subjective Solved Past Paper No.2
vu cs601 Data Communication Solved Past Papers
This subjective solved past paper is related to book/course code vu cs601 Data Communication which belongs to vu organization. We have 4 past papers available related to the book/course Data Communication. This past paper has a total of 10 subjective questions belongs to topic Mid Term to get prepared. NVAEducation wants its users to help them learn in an easy way. For that purpose, you are free to get prepared for exams by learning subjective questions online on NVAEducatio.
NVAEducation also facilitates users to download these solved past papers with an affordable prices. However, users are not enforced to pay for money, rather they can use credits to buy such stuff on NVAEducation. Users can earn credits for doing some little tasks and then you will be able to use that credits to buy solved past papers on NVAEducation.
What are the other two statements of kleenes's theorem?
If a language can be expressed by a RE then it can be accepted by an FA as well.
S is a subset of T. Both sets contain ab.
In S b must be even length where in T b can be odd or even length and S* will contain only even words with b and T will contain words with both even and odd lengths of b. So S* isn't equal to T*.
But, S* is a subset of T* because both sets will contain all even factors of b.
List of types of automata.
- Nondeterministic/Deterministic Finite state machine (FSM)
- Deterministic pushdown automaton (DPDA)
- Pushdown automaton (PDA)
- Linear bounded automaton (LBA)
