Ask
Login

alemnewmirkuzie3

gravatar for alemnewmirkuzie3
Reputation:
Level 0
Status:
Active


Last seen:
7 years ago
Joined:
7 years ago

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

Top contributions by alemnewmirkuzie3

3
votes
1
answer
48k
views
1
answer
State the limitations of Finite Automata
automata theory updated 5.9 years ago by parviagrawal100 • 0
6
votes
2
answers
36k
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.9 years ago by parviagrawal100 • 0
1
vote
1
answer
15k
views
1
answer
Design a mealy machine for binary adder
automata theory updated 5.9 years ago by parviagrawal100 • 0
4
votes
1
answer
15k
views
1
answer
State and explain advantages and limitation of regular and context free grammar.
automata theory updated 4.2 years ago by albakruddin • 0
5
votes
1
answer
13k
views
1
answer
Design Moore Machine for binary adder
automata theory updated 5.9 years ago by parviagrawal100 • 0
7
votes
1
answer
11k
views
1
answer
Short Note on Halting Problem
automata theory updated 5.9 years ago by parviagrawal100 • 0
0
votes
1
answer
11k
views
1
answer
Design PDA for odd length palindrome, let $\sum$ = { 0,1 }, L = { W x $W^R$ where W $\epsilon$ ${\sum}^*$ }
automata theory updated 5.9 years ago by parviagrawal100 • 0
1
vote
1
answer
10k
views
1
answer
Design a NFA accepting input strings that contain either the keyword 000 or 010 and convert it into equivalent DFA.
automata theory updated 5.9 years ago by parviagrawal100 • 0
0
votes
1
answer
10k
views
1
answer
Short Note on Variants of a Turing Machine
automata theory updated 5.9 years ago by parviagrawal100 • 0
0
votes
1
answer
10k
views
1
answer
Design NFA for binary number divisible by 4 or 6
automata theory updated 5.9 years ago by parviagrawal100 • 0
2
votes
881
views
2
votes
A: Design a Mealy machine to accept all strings ending with 00 or 11
updated 6.8 years ago by tusharghangas1 • 0
7
votes
880
views
7
votes
A: Explain Halting Problem
updated 8.1 years ago by shubhamswarn3 • 0
1
vote
477
views
1
vote
A: Design a Turing Machine to recognize the Language$ L={a^n b^n a^n |n>=1}$
updated 8.1 years ago by shubhamswarn3 • 0
0
votes
465
views
0
votes
A: Let G be the grammar. Find the leftmost derivation, rightmost derivation and par
updated 7.0 years ago by sushanth2071 • 0
1
vote
152
views
1
vote
A: Write Short Notes on Chomsky Hierarchy
updated 9.5 years ago by rinali.rini • 60
0
votes
120
views
0
votes
A: Variants of a Turing Machine
updated 8.1 years ago by shubhamswarn3 • 0
0
votes
70
views
0
votes
A: Give a formal definition of a Push Down Automata(PDA)
updated 8.1 years ago by shubhamswarn3 • 0

Latest awards to alemnewmirkuzie3


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