We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>

Looking For Something at vustudents.ning.com? Click Here to Search

www.bit.ly/vucodes

+ Link For Assignments, GDBs & Online Quizzes Solution

www.bit.ly/papersvu

+ Link For Past Papers, Solved MCQs, Short Notes & More


Dear Students! Share your Assignments / GDBs / Quizzes files as you receive in your LMS, So it can be discussed/solved timely. Add Discussion

How to Add New Discussion in Study Group ? Step By Step Guide Click Here.

Theory of Automata (CS402)

Graded Discussion Board

Dear Students,

This is to inform that Graded Discussion Board (GDB) will be opened on August 9, 2016 for discussion and last date for posting your discussion will be August 10, 2016. The topic for discussion is given below:

Graded Discussion Board Topic

Suppose you need to develop a command prompt program. Where user will type certain commands to perform certain task. However, before a command is executed, we need to verify syntax of the command. You have two options here, either to use NFA or DFA. Keeping in mind the characteristics and efficiency of both NFA and DFA (in terms of number of minimum number of transactions) for accepting and rejecting a string, which one of these will be your choice? Justify your answer with solid reasons.

Read the following instructions carefully before sending your comments.
1. Your comments should be relevant to the topic i.e. clear and concise (Maximum 4-5 lines answer).

2. You should post your comments on Graded Discussion Board & not on the Regular MDB.

3. Books, websites and other reading material may be consulted before posting your comments. (Do not copy the material as it is.)

4. GDB will have weight-age of 5% of your total subject marks.

5. No extra time will be given for discussion.

6. You cannot participate in the discussion after the due date or through e-mail.

+ How to Follow the New Added Discussions at Your Mail Address?

+ How to Join Subject Study Groups & Get Helping Material?

+ How to become Top Reputation, Angels, Intellectual, Featured Members & Moderators?

+ VU Students Reserves The Right to Delete Your Profile, If?


See Your Saved Posts Timeline

Views: 690

.

+ http://bit.ly/vucodes (Link for Assignments, GDBs & Online Quizzes Solution)

+ http://bit.ly/papersvu (Link for Past Papers, Solved MCQs, Short Notes & More)

+ Click Here to Search (Looking For something at vustudents.ning.com?)

+ Click Here To Join (Our facebook study Group)

Replies to This Discussion

any one please share your GDB points

As we know about Automata i.e machine which can perform any action without any man power or without direct participation of man. eg: washing machine. Finite Automata means we know the sate of performing task by machine like 1 press ON 2 press OFF so there is only 2 states i.e called finite automata. Now come to DFA i.e deterministic Finite automata. formally mean we can easily determine states there is no ambiguity and informally it need only 1 transition allowed on 1 symbol. NFA: non deterministic finite automata. there is need more time to compute actual state and there is ambiguity andd informally says there is multiple allowed transition on 1 symbol. in the case of time to reach the destination NFA takes more time than DFA but NFA can load more data than DFA. * DFA and NFA has same power to recognize the string

kindly yh batye theek hai yh ni????

deterministic Finite automata. formally mean we can easily determine states there is no ambiguity and informally it need only 1 transition allowed on 1 symbol. NFA: non deterministic finite automata. there is need more time to compute actual state and there is ambiguity andd informally says there is multiple allowed transition on 1 symbol. in the case of time to reach the destination NFA takes more time than DFA but NFA can load more data than DFA. * DFA and NFA has same power to recognize the string

is me kuch GDB k question k alfaaz daalo

When a machine is said to be non-deterministic, it has the power of infinite parallelism. It means that when given a choice, the machine will magically clone itself and each copy will take a different path. A Non-Deterministic Finite Automaton (NFA), for example, can be viewed to be in multiple states at once due to its non-deterministic powers. An NFA can eat its cake and have it too

yh ast line samjh ni ai

mean dfa can understand nfa. and nfa can understand dfa 

Please Discuss here about this GDB.Thanks

Our main purpose here discussion not just Solution

We are here with you hands in hands to facilitate your learning and do not appreciate the idea of copying or replicating solutions.

Suppose you need to develop a command prompt program. Where user will type certain commands to perform certain task. However, before a command is executed, we need to verify syntax of the command. You have two options here, either to use NFA or DFA. Keeping in mind the characteristics and efficiency of both NFA and DFA (in terms of number of minimum number of transactions) for accepting and rejecting a string, which one of these will be your choice? Justify your answer with solid reasons.
DFA should be ur choice because DFA supports a command line interface. NFA are ultimately not any more powerful than DFA that have sufficiently many states. Also before a command is executed, we need to verify syntax of the command so DFA is suitable for this Because DFA is used to verify the validity of something in software. DFA reject the string if it ends at other than accepting state. DFA is complex than NFA but it is quite faster than NFA too. It neede less time for execution of input string as compared to NFA because the number of next state in DFA is exactly one. It doesn’t need to guessing like DFA.

RSS

© 2019   Created by + M.Tariq Malik.   Powered by

Promote Us  |  Report an Issue  |  Privacy Policy  |  Terms of Service

.