Recent questions tagged finite-automata

1 votes
1 answer
541
Ques:- What are the number of final states in minimal DFA, where ∑= {a, b}, if every string starts with “aa” and length of the string is not congruent to 0 (mod 4)....
0 votes
1 answer
542
If there are Q states in NFA, DFA should have at max $2^{Q}$ states. Keeping this thing in mind I answered the question but it went wrong.Please if anyone can give the co...
4 votes
2 answers
545
The $FSM$ (Finite State Machine) machine pictured in the figure aboveComplements a given bit patternFinds $2's$ complement of a given bit patternIncrements a given bit pa...
1 votes
1 answer
548
1 votes
0 answers
549
0 votes
1 answer
553
Complementation of DFA works for all DFA is it true ?Given DFA, a should be followed by a 'b',In the complementation of this DFA the string aab is getting accepted a is g...
0 votes
2 answers
554
0 votes
1 answer
555
0 votes
1 answer
556
Construct a DFA such that it accepts all strings over $\{a,b\}$ in which there are at least two occurrences of $b$ between any two occurrences of $a$.
3 votes
1 answer
557
1 votes
0 answers
558
3 votes
1 answer
560
What's is the meaning of the statement:- An automatic is a cognitive device and a grammar is a generative device. What does the word cognitive and generative mean in this...
1 votes
1 answer
561
Consider the DFA M :Number of distinct strings of length $3$ such that $\delta(q_{0},w) = q_{0}$$10$$14$$18$$20$
1 votes
1 answer
562
Give Regular Expression for Language of all those strings which do not contain the substring ‘bb’. Also draw its DFA.
1 votes
1 answer
563
Give Regular Expression for the Language of all those strings which end with ‘aa’ or ‘ab’ and have odd length. Also, draw its DFA.
1 votes
1 answer
564
1 votes
0 answers
565
$\sum = \left \{ a,b \right \}$Is it possible to create DFA for given language with less than 10 states?L = $\left \{ w: \left | w \right | mod 3 = 0, \left |w \right | \...
1 votes
0 answers
566
1 votes
1 answer
567
1 votes
2 answers
569
1 votes
0 answers
570
Is minimization of Finite State Machine(FSM) based on Dynamic Programming(DP) paradigm ? If yes , then what should be the optimal substructure and overlapping subproblems...