Register

Recent questions tagged finite-automata

2 votes
2 answers
961
Why is $a^{n}b^{n} \cup a^{*}b^{*}$ regular ?
Why is $a^{n}b^{n} \cup a^{*}b^{*}$ regular ? Does this imply that a subset of non regular language can be regular ?
Why is $a^{n}b^{n} \cup a^{*}b^{*}$ regular ?Does this imply that a subset of non regular language can be regular ?
User Avatar
2 votes
2 answers
962
FSM
Choose the correct one - A) a FSM with 1 stack is more powerful than a FSM without stack B) a FSM with 3 stack is more powerful than a FSM with 2 stack C) a FSM with 2 stack is more powerful than a FSM with 1 stack D) both A and C
Choose the correct one -A) a FSM with 1 stack is more powerful than a FSM without stackB) a FSM with 3 stack is more powerful than a FSM with 2 stackC) a FSM with 2 stack...
User Avatar
2 votes
1 answer
963
Non-deterministic Finite Machine
Let M be a Non-deterministic Finite Machine. Let G be the Regular Grammar obtained from M. Which is True? (a) G will always be unambiguous (b) G will always be ambiguous (c) G may be ambiguous (d) None of the above
Let M be a Non-deterministic Finite Machine. Let G be the Regular Grammar obtained from M. Which is True?(a) G will always be unambiguous(b) G will always be ambiguous(c)...
User Avatar
2 votes
2 answers
969
NFA to DFA Conversion
If NFA has n states, then its DFA can have______states in worst case.
If NFA has n states, then its DFA can have______states in worst case.
User Avatar
3 votes
1 answer
971
Relation between given regular Expression (Finite Automata)
Let A= (a + b)* ab (a + b)*, B= a*b* and C= (a + b)*. Then the relation between A, B and C: A. A+B= C B. A+Reverse(B)= C C. Reverse(A)+B= C D. None
Let A= (a + b)* ab (a + b)*,B= a*b* andC= (a + b)*.Then the relation between A, B and C:A. A+B= C B. A+Reverse(B)= C C. Reverse(A)+B= C D. None
User Avatar
2 votes
3 answers
972
Consider 2 scenarios: C1: For DFA (ϕ, Ʃ, δ, qo, F), if F = ϕ, then L = Ʃ* C2: For NFA (ϕ, Ʃ, δ, qo, F)
Consider 2 scenarios:C1: For DFA (ϕ, Ʃ, δ, qo, F),if F = ϕ, then L = Ʃ*C2: For NFA (ϕ, Ʃ, δ, qo, F),if F = ϕ, then L = Ʃ*Where F = Final states setϕ = Total st...
User Avatar
4 votes
5 answers
974
minimal DFA
The minimal state DFA, accepting all strings over the alphabet {0,1} where the nth symbol in every string from the right end is a 1, has a) 2n states b) 2n-1 states c) 2n+1 states d) None of the above  
The minimal state DFA, accepting all strings over the alphabet {0,1} where the nth symbol in every string from the right end is a 1, hasa) 2n states b) 2n-1 states c) 2n...
User Avatar
4 votes
1 answer
980
Build an FA that accepts the language of all strings of a's and b's such that next-to-last letter is an a
Build an FA that accepts the language of all strings of a's and b's such that next-to-last letter is an $a$.
User Avatar
4 votes
4 answers
981
DFA to accept a binary number divisible by 2
Sorry for the bad quality picture. Which of these is correct? (1 or 2)
Sorry for the bad quality picture. Which of these is correct? (1 or 2)
User Avatar
36 votes
6 answers
985
GATE CSE 2015 Set 2 | Question: 53
The number of states in the minimal deterministic finite automaton corresponding to the regular expression $(0+1)^* (10)$ is _____.
The number of states in the minimal deterministic finite automaton corresponding to the regular expression $(0+1)^* (10)$ is _____.
User Avatar
14 votes
5 answers
986
No. of states in the minimal finite automata which accepts the binary strings whose equivalent is divisible by 32 is ________?
No. of states in the minimal finite automata which accepts the binary strings whose equivalent is divisible by 32 is ________?A. 5B. 6C 31D 32
User Avatar
Page: