CS402 GDB Solution & Discussion Due date: 26 Jan, 2018

[Taimoor Rasheed]

Graded Discussion:

Scenario:

With the advancement in technology, industry has been moving towards automation and intelligence. In this regards artificial intelligence and machine learning has played a vital role. Natural language processing (NLP) is a field of computer science and linguistics which focuses on methods to process the natural languages. By keeping in mind the basic concepts of theory of automata you have to elaborate that Finite state machine [FSM] or Push down Automata, which one is more reliable and efficient in natural language processing? Justify your answer with proper reasons.

[+ M.Tariq Malik]

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. Read More>>

Discussed & be touched with this discussion. After discussion a perfect solution will come in a result at the end.

 

Note:-

For Important Helping Material related to this subject (Solved MCQs, Short Notes, Solved past Papers, E-Books, FAQ,Short Questions Answers & more). You must view all the featured Discussion in this subject group.

For how you can view all the Featured discussions click on the Back to Subject Name Discussions link below the title of this Discussion & then under featured Discussion corner click on the view all link.

Or visit this link 

Click Here For Detail.

&

.•°How to Download past papers from study groups°•.

 

Please Click on the below link to see…

.... How to Find Your Subject Study Group & Join .... 

 

P.S:    Please always try to add the discussion in proper format title like “CS101 Assignment / GDB No 01 Solution & Discussion Due Date: ___________”

[Saba Alam]

please sir cs402 mdb solution last date 26/1/2018

[Ahmad Ali]

Solution Required plzzzzzzzzzzzzzz

[Aaqib Raza]

In computer science, a pushdown automaton (PDA) is a type of automaton that employs a stack.Pushdown automata are used in theories about what can be computed by machines. They are more capable than finite-state machines but less capable than Turing machines.

[Saba Alam]

Please share mdb solution cs402

[BS-Software Eng. (5th)]

everyone share your idea solutions fast

[Toheed khokhar]

GDB Solution:-

For Natural language processing (NLP) which is a field of computer science and linguistics which focuses on methods to process the natural languages artificial intelligence Pushdown automata are best in theories about what can be computed by machines. They are more capable than finite state machine.

Reason:-

Pushdown Automata is a finite automaton with extra memory called stack which helps Pushdown automata to recognize Context Free Languages while A finite-state machine (FSM), is a mathematical model of computation.

Example : Define the pushdown automata for language {aⁿbⁿ |n>0}
Solution : M = where Q = { q0, q1 } and ∑ = { a, b } and Γ = { A, Z } and δ is given by :

 

δ(q0,a,Z)={(q0,AZ)}
δ(q0,a,A)={(q0,AA)}
δ(q0,b,A)={(q1,ɛ)}
δ(q1,b,A)={(q1,ɛ)}
δ( q1, ɛ, Z) = { ( q1, ɛ) }

 

[imran mahais]

share your idea plsss