Register

Recent questions tagged finite-automata

1 votes
2 answers
486
TOC Finite Automata
How to construct a finite automata equivalent to the regular expression: ( 0 + 1 )* ( 00 + 11 ) ( 0 + 1 )*
How to construct a finite automata equivalent to the regular expression: ( 0 + 1 )* ( 00 + 11 ) ( 0 + 1 )*
User Avatar
0 votes
1 answer
487
Theory of computation
Which of the following CFG’s can’t be simulated by an FSM ? a. S->Sa/b b. S->aSb/ab c. S->abX, X->cY, Y->d/aX d. None of these
Which of the following CFG’s can’t be simulated by an FSM ?a.S->Sa/bb.S->aSb/abc.S->abX, X->cY, Y->d/aXd.None of these
User Avatar
0 votes
6 answers
489
Doubt-DFA
what is the grammar generated by the complement of this DFA and what is the type?
what is the grammar generated by the complement of this DFA and what is the type?
User Avatar
0 votes
1 answer
490
Finite State Automata
Every DFA is NFA but not vice versa Can you please explain how this statement is true? Reference:- https://www.geeksforgeeks.org/toc-finite-automata-introduction/
Every DFA is NFA but not vice versaCan you please explain how this statement is true?Reference:- https://www.geeksforgeeks.org/toc-finite-automata-introduction/
User Avatar
1 votes
1 answer
495
Made Easy Theory Book
Can somebody please explain the meaning of the following statement : An automation is a cognitive device and a grammar is a generative device.
Can somebody please explain the meaning of the following statement : An automation is a cognitive device and a grammar is a generative device.
User Avatar
0 votes
2 answers
496
Regular expression
Is a*b* + b*a* = ( a + b)* ______
Is a*b* + b*a* = ( a + b)* ______
User Avatar
0 votes
3 answers
497
Theory of Computation - Finite Automata
Can someone please help me understand these two points about minimum DFA and Minimum NFA, thank you
Can someone please help me understand these two points about minimum DFA and Minimum NFA, thank you
User Avatar
0 votes
1 answer
499
Gate overflow old question
Referring to the question https://gateoverflow.in/227957/self-doubt If the TM accepts exactly 100 strings can we not design a FA for it which would make it a regular language?
Referring to the question https://gateoverflow.in/227957/self-doubtIf the TM accepts exactly 100 strings can we not design a FA for it which would make it a regular langu...
User Avatar
2 votes
2 answers
500
#Self Doubt
Minimum number of states in DFA over Ʃ = {0, 1} with each string contains odd number of 0’s or odd number of 1’s.
Minimum number of states in DFA over Ʃ = {0, 1} with each string contains odd number of 0’s or odd number of 1’s.
User Avatar
0 votes
1 answer
501
#Self doubt
User Avatar
0 votes
1 answer
503
theory of computation
check whether given language is regular or not 1) (an) n where n ≥1 2) ( am ) n where n ≥ 1 3) w= { (( a 2 ) n) * (( an )2 )* } where n ≥ 1
check whether given language is regular or not 1) (an) n where n ≥12) ( am ) n where n ≥ 13) w= { (( a 2 ) n) * (( an )2 )* } where n ≥ 1
User Avatar
0 votes
1 answer
505
minimum dfa
minimized dfa for strings starts with ab and ends with aba over Σ={a,b}
minimized dfa for strings starts with ab and ends with aba over Σ={a,b}
User Avatar
0 votes
1 answer
506
peter linz
Let L be the language formed by L={anb | n>=0}. Find a DFA that accepts L2-L.
Let L be the language formed by L={anb | n>=0}.Find a DFA that accepts L2-L.
User Avatar
1 votes
0 answers
507
self doubt
is it necessary for the gate exam that minimisation of dfa can be solved by partitiong method ?? will it be safe to escape partitining method and problem can be solved by table filling method??
is it necessary for the gate exam that minimisation of dfa can be solved by partitiong method ?? will it be safe to escape partitining method and problem can be solved by...
User Avatar
0 votes
1 answer
509
GATE - TOC Regular Languages & FA
Let L(r1)=(b*ab*ab*ab*)* & L(r2)=(b*ab*ab*)*. What is L(r1) Intersection L(r2)? a) (b*ab*ab*ab*)* b) (b*ab*ab*)* c) (b*ab*ab*)^6 d) (b*ab*ab*ab*ab*ab*ab*)* Please do explain also.
Let L(r1)=(b*ab*ab*ab*)* & L(r2)=(b*ab*ab*)*. What is L(r1) Intersection L(r2)?a) (b*ab*ab*ab*)*b) (b*ab*ab*)*c) (b*ab*ab*)^6d) (b*ab*ab*ab*ab*ab*ab*)*Please do explain a...
User Avatar
0 votes
0 answers
510
GATE - TOC Regular Languages and FA
Let r1=(b*ab*ab*ab*)* , r2=(b*ab*ab*)*. What is L(r1) intersection L(r2)? a) (b*ab*ab*ab*)* b) (b*ab*ab*)* c) (b*ab*ab*)^6 d) (b*ab*ab*ab*ab*ab*ab*)*
Let r1=(b*ab*ab*ab*)* , r2=(b*ab*ab*)*. What is L(r1) intersection L(r2)?a) (b*ab*ab*ab*)*b) (b*ab*ab*)*c) (b*ab*ab*)^6d) (b*ab*ab*ab*ab*ab*ab*)*
User Avatar
Page: