CS402 Theory of Automata GDB Spring 2020 Solution & Discussion
+ 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)
Share the GDB Question & Discuss Here....
Click on below link to download
CS402 GDB Solution Sprig 2020
CS402 GDB Spring 2020
As we know that there are different types of Finite State Machines (FSM) are available. You have to explain which FSM works better on the basis of speed (faster reaction to inputs) and Design (Easy to Design) but you have to mention other points of these state machines also.
Furthermore you need to explain it in maximum 5 points if one Finite State Machine is used for both situations and 10 points total if different Finite State Machines are required on the basis of speed and Design.
CS402 GDB No.1 2020
Mealy machines react faster to inputs. They generally react in the same clock cycle.
Mealy machine changes its output based on its current input and present state.
Not necessarily easy to design.
Mealy machine will have same or fewer states than Moore machine.
Outputs are placed on transition.
The value of the output function is a function of the transitions and the changes, when the input logic on the present state is done.
Asynchronous output generation through the state changes synchronous to the clock.
Generally requires fewer states for synthesis.
Requires less hardware to design.
A counter is not a Mealy machine
Output of Moore machine only depends on its current state and not on the current input.
Generally, it has more states than Mealy machine.
Easy to design.
Output is placed on transition.
The value of the output function is a function of the current state and the changes at the clock edges. Whenever state changes occur.
In Moore machines, more logic is required to decode the output resulting in more circuit delays. They generally react one clock cycle later.
Both output and state changes synchronous to the clock edge.
Generally requires more states for synthesis.
More hardware is required to design.
A counter is a Moore Machine.
You need to explain it in maximum 5 points Mealy Machine
and 5 points Moore Machine and total 10 points.
Dear Students you have to make your GDB by yourself because everyone cannot submit same GDB kindly something could be change. Otherwise will be mark zero so please be careful.
Remember in your prayer Muhammad Aaqib Saleem
cs402 gdb Solution, cs402 gdb Solution 2020, cs402 gdb 2020,
A Finite State machine can't be used as recognizer for context-free language.
Mealy and Moore both machines are also finite machine, and can't be use as recognizer for context-free-language. Although, both machines have ability to write symbols.
Turing Machine is more capable or powerful than push down automata to use as recognizer for Context-free language. TM comprises of two way infinite tapes, made of cells, with infinite memory. There is a head tape too that uses to read the symbols stored in cells of two way infinite tapes. Recursive procedures are another feature of Turing Machine. TM can only perform manipulation of finite amount of data. Turing machine has the ability to explain the algorithms independent of how much memory they use.
cs402 gdb solution
cs402 gdb solution