Register

Recent questions tagged finite-automata

0 votes
2 answers
362
#TOC What will be the minimal DFA of this regular language?
Given L = { 0*1 + 0 + 1* + 10*1} where + symbol is UNION and NOT positive closure. Please draw the Minimal DFA for this.
Given L = { 0*1 + 0 + 1* + 10*1}where + symbol is UNION and NOT positive closure.Please draw the Minimal DFA for this.
User Avatar
0 votes
2 answers
371
#TOC #Examples
Give examples of: Countable Infinite Set Countable Finite Set Uncountable Finite Set Uncountable Infinite Set
Give examples of:Countable Infinite SetCountable Finite SetUncountable Finite SetUncountable Infinite Set
User Avatar
1 votes
0 answers
372
#TOC #PumpingLemma
What is Pumping length? Why we consider pumping length of certain numbers? Can Pumping length be 0?
What is Pumping length?Why we consider pumping length of certain numbers?Can Pumping length be 0?
User Avatar
0 votes
0 answers
373
#TOC #NesoAcademy #Tutorial
“ Every state on $\epsilon$ goes to itself in $\epsilon NFA$ “ How is this so?
“ Every state on $\epsilon$ goes to itself in $\epsilon NFA$ “How is this so?
User Avatar
0 votes
0 answers
374
#TOC #GeneralGuidance
I am new to the topic of TOC and finding it difficult to develop intuition for questions. Though,I am good with Mathematics and someone told TOC is mathematical concept. How should I study TOC specifically?
I am new to the topic of TOC and finding it difficult to develop intuition for questions.Though,I am good with Mathematics and someone told TOC is mathematical concept. H...
User Avatar
0 votes
1 answer
375
#TOC #DFANFA
How is Every DFA is NFA but not vice-versa? Not able to get it. Please explain.
How is Every DFA is NFA but not vice-versa?Not able to get it. Please explain.
User Avatar
1 votes
2 answers
376
self doubt
Let L = { (a^p)* | p is prime number } and input is {a} . what is minimum number of state in NFA and DFA ?
Let L = { (a^p)* | p is prime number } and input is {a} . what is minimum number of state in NFA and DFA ?
User Avatar
0 votes
2 answers
378
#toc How to make DFA for this.
How to draw a DFA for the below language. $L$ = {$W | W \in$ $ (0, 1)^* $}; $W$ ends with 0 and contains the substring 100 } No. of states in minimal DFA.
How to draw a DFA for the below language.$L$ = {$W | W \in$ $ (0, 1)^* $};$W$ ends with 0 and contains the substring 100 }No. of states in minimal DFA.
User Avatar
2 votes
0 answers
379
AAI Mock 4 - TOC
Which of the following are regular languages?
Which of the following are regular languages?
User Avatar
0 votes
1 answer
382
finite automata
Find the number of states in minimized DFA that accepts languages over sigma={a,b},where each string has exactly three a’s and two b’s.
Find the number of states in minimized DFA that accepts languages over sigma={a,b},where each string has exactly three a’s and two b’s.
User Avatar
0 votes
2 answers
383
Regular Languages
Is this language regular? If yes, how? L = {wxwR | x, w ϵ {0, 1}*} wR is reverse of string w. Thank you!
Is this language regular? If yes, how?L = {wxwR | x, w ϵ {0, 1}*}wR is reverse of string w. Thank you!
User Avatar
0 votes
1 answer
384
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
386
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
388
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
389
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
Page: