# Recent questions tagged nfa-dfa

0 votes
0 answers 5 views
Given language L = strings starting with 'a'. Sigma(Alphabet) = {a,b} DFA: It should only accept the given language and reject other languages. Therefore only strings starting with 'a' MUST be accepted by the DFA, and the strings starting with 'b' MUST ... and Regular expressions are not correctly defined by me, can you please define all these clearly so that it becomes easy to distinguish them.
0 votes
0 answers 7 views
if language is finite then dfa possible irrespective of comparison between symbols exist or not.is it true??
0 votes
0 answers 16 views
What is the NFA that does not accept strings ending “101” ?
0 votes
0 answers 46 views
Construct a right-linear grammar for L((aab)*a) . Make the corresponding NFA for it also. I tried grammar as- Vo → aV1 V1→ ab | ϵ But I’m not sure, Please help me out . Here is the NFA I tried https://app.box.com/s/yg1yvmu7zkyjqzbku71f5aueabk3kcin
0 votes
1 answer 39 views
Construct the minimal DFA for the following $\epsilon$ NFA NOTE: No need to give a complete explanation. Just provide me the final answer whatever you are getting means the number of states and the name of the states.
0 votes
1 answer 39 views
S1: Epsilon nfa has more than one initial state S2: Nfa has more than one initial state Which of the above is true and which of the above is false?
0 votes
1 answer 30 views
For every NFA with arbitrary number of final states, there is a equivalent NFA with only one final state. true/false
1 vote
1 answer 26 views
Given An arbitary non-deterministic finite automation with N states,the maximum numer of states in an equivalent minimized DFA is atleast?
0 votes
2 answers 53 views
Q: find the NFA that accepts -: $L((a+b)a^*)\cap L(baa^*)$ Answer $L((a+b)a^*)∩ L(baa^*) = L(b(a^+))$ NFA is : A,B,C three states, C is the final state A on “b” goes to B B on “a” goes to C C on “a” goes to C ie a*
To see more, click for the full list of questions or popular tags.