Register

Recent questions tagged finite-automata

0 votes
1 answer
391
Self Doubt
Find the minimum number of states in the DFA which accept the language of all strings that begin or end with 00 or 11.
Find the minimum number of states in the DFA which accept the language of all strings that begin or end with 00or 11.
User Avatar
0 votes
0 answers
393
MadeEasy Subject Test 2019: Theory of Computation - Finite Automata
Consider the following NFA M , over the alphabet {a} let L(M) be the language accepted by the NFA M . let $M'$ ... $L (M' ) - L(M)) = phi$ $L (M' ) \cup L(M)) = phi$
Consider the following NFA M , over the alphabet {a}let L(M) be the language accepted by the NFA M . let $M'$ denote the machine obtained by the final and non final sta...
User Avatar
0 votes
0 answers
395
made easy mock1
let L={set of all strings over {0,1}* , containing 01 and 011 as the substring } number of states in the minimal DFA of L’ is? i’m getting 3. please confirm if you are getting 3 or 4.
let L={set of all strings over {0,1}* , containing 01 and 011 as the substring }number of states in the minimal DFA of L’ is?i’m getting 3. please confirm if you are ...
User Avatar
0 votes
2 answers
396
MadeEasy Test Series: Theory Of Computation - Finite Automata
How may Moore/Mealy m/c are possible with two states X & Y for the input alphabet {a, b} and output alphabet {0, 1} , where x is always the initial state?
How may Moore/Mealy m/c are possible with two states X & Y for the input alphabet {a, b} and output alphabet {0, 1} , where x is always the initial state?
User Avatar
0 votes
1 answer
398
Theory Of computation
How many maximum number of production rules are possible in regular grammar equivalent to a given n state DFA, over the input alphabet {a,b,c} where q1 is always the initial state? Answer: 6n + 1
How many maximum number of production rules are possible in regular grammar equivalent to a given n state DFA, over the input alphabet {a,b,c} where q1 is always the init...
User Avatar
0 votes
0 answers
399
Theory Of Computation
How many Moore machines are possible with two states X and Y for the input alphabet {a,b} and output alphabet {0,1}, where X is always the initial state?
How many Moore machines are possible with two states X and Y for the input alphabet {a,b} and output alphabet {0,1}, where X is always the initial state?
User Avatar
0 votes
1 answer
404
Self doubt TOC DFA
Construct a minimal DFA which accepts set of all strings over {a,b}, such that $1)$Second symbol from $RHS$ should be $‘a’$ $2)$Third symbol from $RHS$ should be $‘a’$
Construct a minimal DFA which accepts set of all strings over {a,b}, such that$1)$Second symbol from $RHS$ should be $‘a’$$2)$Third symbol from $RHS$ should be $‘a�...
User Avatar
0 votes
1 answer
409
selfdoubt
Give an example of DFA minimization where the initial state is final state and there are one or more final states
Give an example of DFA minimization where the initial state is final state and there are one or more final states
User Avatar
1 votes
2 answers
410
DFA doubt
DFA in which 01 and 10 have equal number of occurrences
DFA in which 01 and 10 have equal number of occurrences
User Avatar
0 votes
2 answers
411
Minimal DFA
Given following NFA find the minimal equivalent DFA
Given following NFAfind the minimal equivalent DFA
User Avatar
0 votes
1 answer
412
Conversion of NFA to DFA
convert the following NFA to DFA
convert the following NFA to DFA
User Avatar
3 votes
1 answer
414
Reversal of DFA doubt
in reversal of DFA if there are more than one final states then which one will be made the initial state? a DFA can have only one initial state
in reversal of DFA if there are more than one final states then which one will be made the initial state? a DFA can have only one initial state
User Avatar
0 votes
3 answers
417
NIELIT 2018-40
Consider the following Finite State Automaton. The language accepted by the automaton is given by the regular expression. $ab^*b^*$ $a^*b^*$ $b^*b$ $b^*ab^*$
Consider the following Finite State Automaton. The language accepted by the automaton is given by the regular expression.$ab^*b^*$$a^*b^*$$b^*b$$b^*ab^*$
User Avatar
0 votes
0 answers
418
DFA NFA and ambiguity
Why is Regular grammar obtained from DFA always unambiguous? Why Regular grammar obtained from NFA may or may not be ambiguous?
Why is Regular grammar obtained from DFA always unambiguous?Why Regular grammar obtained from NFA may or may not be ambiguous?
User Avatar
1 votes
1 answer
420
Self doubt about relation between regular and linear grammar
If a grammar G is both left linear as well as right linear then,what should be the case a) G is always not regular b) G may or may not be regular c) something else
If a grammar G is both left linear as well as right linear then,what should be the case a) G is always not regularb) G may or may not be regularc) something else
User Avatar
Page: