CS402 GDB Solution 2022

This is CS402 GDB Solution 2022.The Topic of GDB is "Finite Automata & Push down Automata". The last date of GDB is 4 March 2022.

Note: We are providing best paid services of Unique Virtual University GDB Solutions l Unique Virtual University Solutions GDB for good output. We are doing work worldwide in Typing, CV, Assignments, GDB, Quiz, Paper help, Research Project (Thesis), Lesson Plan, Research Report and CS Projects (Php Language).

Recommend you to Read:

How to Submit CS402 GDB Complete Guideline

Scenerio:

A group of computer scientists at Manchester University, UK needs a machine to implement a language L= {yyꞌ where yꞌ= Rev(y), y∈ (0,1)*} i.e L={00, 11, 0110, 001100, 010010, …}

The machine should fulfill the following points:

Each input alphabet can have more than one possibility to move to the next state.
No space limitation.

Requirements:

Now which of the following machine(s) will be the most favorable in order to achieve the above characteristics?

Finite Automaton with stack
Non deterministic Push Down Automata
Push down automata with 2 stacks

Justify your answer with valid reasons.

Answer:

After reading the scenario, I prefer Non-deterministic Push Down Automata (NPDA) and its characteristics are as follows:

Non-deterministic Push Down Automata (NPDA) have more than one move from a state on an input symbol and stack symbol.
Non-deterministic Push Down Automata (NPDA) are like as Finite Automata (FA) and have a stack memory where they can store an arbitrary amount of information.

Non-deterministic Push Down Automata (NPDA) have more than one result and there is no limitations in space.
Non-deterministic Push Down Automata (NPDA) is more powerful.