Ask
Login

pratikj2208

gravatar for pratikj2208
pratikj2208 • 140
Reputation:
Level 0
Status:
Active


Last seen:
6 years, 2 months ago
Joined:
6 years, 2 months ago

Profile Strength:
20%
  • 32
    Questions
  • 7
    Answers
  • 29
    Awards
Information Technology
Mumbai University (MU)

Top contributions by pratikj2208

3
votes
1
answer
47k
views
1
answer
State the limitations of Finite Automata
automata theory updated 5.1 years ago by prashantsaini • 0
4
votes
2
answers
33k
views
2
answers
Construct a Mealy machine to accept all strings ending with 00 or 11. Convert the same to Moore Machine (Patrial answer)
automata theory updated 5.1 years ago by prashantsaini • 0
4
votes
1
answer
14k
views
1
answer
State and explain advantages and limitation of regular and context free grammar.
automata theory updated 3.4 years ago by barunipriyats • 120
1
vote
1
answer
14k
views
1
answer
Design a mealy machine for binary adder
automata theory updated 5.1 years ago by prashantsaini • 0
5
votes
1
answer
12k
views
1
answer
Design Moore Machine for binary adder
automata theory updated 5.1 years ago by prashantsaini • 0
7
votes
1
answer
11k
views
1
answer
Short Note on Halting Problem
automata theory updated 5.1 years ago by prashantsaini • 0
0
votes
1
answer
10.0k
views
1
answer
Design PDA for odd length palindrome, let ∑ = { 0,1 }, L = { W x WR where W ϵ ∑∗ }
automata theory updated 5.1 years ago by prashantsaini • 0
0
votes
1
answer
9.7k
views
1
answer
Short Note on Variants of a Turing Machine
automata theory updated 5.1 years ago by prashantsaini • 0
0
votes
1
answer
9.6k
views
1
answer
Design NFA for binary number divisible by 4 or 6
automata theory updated 5.1 years ago by prashantsaini • 0
1
vote
1
answer
9.4k
views
1
answer
Write Short Notes on Chomsky Hierarchy
automata theory updated 4.4 years ago by ninadsail • 10
7
votes
878
views
7
votes
A: Explain Halting Problem
updated 7.3 years ago by awari.swati831 • 100
1
vote
812
views
1
vote
A: Design a Mealy machine to accept all strings ending with 00 or 11
updated 6.0 years ago by ankitpandey • 100
1
vote
456
views
1
vote
A: Design a Turing Machine to recognize the LanguageL=anbnan|n>=1
updated 7.3 years ago by awari.swati831 • 100
0
votes
436
views
0
votes
A: Let G be the grammar. Find the leftmost derivation, rightmost derivation and par
updated 6.3 years ago by abhishektiwari1 • 100
1
vote
149
views
1
vote
A: Write Short Notes on Chomsky Hierarchy
updated 8.7 years ago by poojajoshi • 100
0
votes
120
views
0
votes
A: Variants of a Turing Machine
updated 7.3 years ago by awari.swati831 • 100
0
votes
69
views
0
votes
A: Give a formal definition of a Push Down Automata(PDA)
updated 7.3 years ago by awari.swati831 • 100

Latest awards to pratikj2208


created an answer with at least 3 up-votes

created a question with more than 1,000 views

created a question with more than 10,000 views

created a question with more than 5,000 views