Register

Recent questions tagged finite-automata

0 votes
1 answer
511
Finite automata
1.How to identify the reachable state in NFA or DFA.
1.How to identify the reachable state in NFA or DFA.
User Avatar
1 votes
2 answers
512
UGC NET CSE | July 2018 | Part 2 | Question: 31
Two finite state machines are said to be equivalent if they: Have the same number of edges Have the same number of states Recognize the same set of tokens Have the same number of states and edges
Two finite state machines are said to be equivalent if they:Have the same number of edgesHave the same number of statesRecognize the same set of tokensHave the same numbe...
User Avatar
0 votes
1 answer
514
Made easy workbook
match the following Caption
match the following Caption
User Avatar
0 votes
0 answers
515
minimum finite automata
construct the minimul FA, that accepts all the string of 0's and 1's A)The second symbol from the right end of the string is 0 B)The third symbol from the right end of the string is 1
construct the minimul FA, that accepts all the string of 0's and 1'sA)The second symbol from the right end of the string is 0B)The third symbol from the right end of the ...
User Avatar
0 votes
1 answer
516
Minimum finite automata
Construct the Minimum FA that accepts all the string of 0's and 1's where A)Every String start and end with Zero. B)Every string Start and end with Same Symbol.
Construct the Minimum FA that accepts all the string of 0's and 1's whereA)Every String start and end with Zero.B)Every string Start and end with Same Symbol.
User Avatar
0 votes
2 answers
519
NFA TOC
Consider the following NFA. Length of the shortest string which is not accepted by NFA ?
Consider the following NFA.Length of the shortest string which is not accepted by NFA ?
User Avatar
0 votes
1 answer
522
#DFA #TOC #theoryofcomputation
How to construct an automata with even number of a's OR odd number of b's?
How to construct an automata with even number of a's OR odd number of b's?
User Avatar
0 votes
0 answers
527
Minimal dfa
How many states will be present in L={w/(n(a) + (2 n(b)mod 3)) lessthan 2} ? (I got 7 states is that correct)
How many states will be present in L={w/(n(a) + (2 n(b)mod 3)) lessthan 2} ? (I got 7 states is that correct)
User Avatar
0 votes
1 answer
532
theory of computation
What is the maximum number of productions possible in the regular grammar equivalent to n-state DFA over input alphabet {a,b,c} where qi is always initial state?
What is the maximum number of productions possible in the regular grammar equivalent to n-state DFA over input alphabet {a,b,c} where qi is always initial state?
User Avatar
0 votes
1 answer
536
Toc dfa
User Avatar
1 votes
2 answers
537
Toc dfa
The minimum number of state in the DFA for the language $L = \{ w \mid (n_a(w)+2n_b(w))mod \hspace{0.1cm} 3<2 \} $ is
The minimum number of state in the DFA for the language $L = \{ w \mid (n_a(w)+2n_b(w))mod \hspace{0.1cm} 3<2 \} $ is
User Avatar
0 votes
2 answers
539
Toc DFA
The minimum number of state in the DFA for the language $L = \{ w \mid w \in \{a,b\}^* \text{ w has exactly two a's and at least two b's} \}$ is $9$ $10$ $16$ None
The minimum number of state in the DFA for the language $L = \{ w \mid w \in \{a,b\}^* \text{ w has exactly two a's and at least two b's} \}$ is $9$$10$$16$None
User Avatar
0 votes
0 answers
540
Automata
Statement-no. of transition defined states in a DFA =|€|. Where |€|= length of input alphabet. Why?
Statement-no. of transition defined states in a DFA =|€|. Where |€|= length of input alphabet. Why?
User Avatar
Page: