Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Some useful problems
Recent questions tagged finite-automata
0
votes
1
answer
601
#TOC DOUBT
A)Is it useful to draw FA if we need to tell the language of the following grammar...? B)What is the language of the following grammar..? C) What will be the final state Of FA and what is the criteria to find out final state.if a given a regular grammar.? S→aB|bA A→aS|bAA|a B→bS|aBB|b
A)Is it useful to draw FA if we need to tell the language of the following grammar...?B)What is the language of the following grammar..?C) What will be the final state O...
Sahil1994
787
views
Sahil1994
asked
Dec 12, 2017
Theory of Computation
theory-of-computation
finite-automata
regular-grammar
+
–
0
votes
0
answers
602
MadeEasy Test Series: Theory Of Computation - Finite Automata
why c is incorrect ??
why c is incorrect ??
air1ankit
282
views
air1ankit
asked
Dec 12, 2017
Theory of Computation
theory-of-computation
made-easy-test-series
finite-automata
+
–
8
votes
1
answer
603
TIFR CSE 2018 | Part B | Question: 2
Consider the following non-deterministic automation, where $\large s_{1}$ is the start state and $\large s_{4}$ is the final (accepting) state. The alphabet is $\{a,b\}.$ A transition with label $\large\epsilon$ can be taken without consuming any symbol from the input. Which of the ... $aba(a+b)^{*}aba$ $(a+b)aba(b+a)^{*}$ $aba(a+b)^{*}$ $(ab)^{*}aba$
Consider the following non-deterministic automation, where $\large s_{1}$ is the start state and $\large s_{4}$ is the final (accepting) state. The alphabet is $\{a,b\}.$...
Arjun
1.4k
views
Arjun
asked
Dec 10, 2017
Theory of Computation
tifr2018
regular-expression
finite-automata
+
–
0
votes
0
answers
604
self_doubt theory of computation
....... how can we solve question by this table need help
.......how can we solve question by this table need help
air1ankit
287
views
air1ankit
asked
Dec 8, 2017
Theory of Computation
theory-of-computation
regular-expression
finite-automata
turing-machine
+
–
2
votes
2
answers
605
[Doubt] Conversion of finite automata to regular expression
How to convert given finite state automaton into regular expression.
How to convert given finite state automaton into regular expression.
tonystark007
1.3k
views
tonystark007
asked
Dec 8, 2017
Theory of Computation
theory-of-computation
finite-automata
regular-expression
+
–
0
votes
0
answers
606
MadeEasy Test Series: Theory Of Computation - Finite Automata
Answer given is : 6 How to solve such questions?
Answer given is : 6How to solve such questions?
charul
361
views
charul
asked
Dec 6, 2017
Theory of Computation
made-easy-test-series
theory-of-computation
finite-automata
+
–
1
votes
1
answer
607
Stanford(Automata Theory)
The operation DM(L) is defined as follows: Throw away every even-length string from L. For each odd-length string, remove the middle character. For example, if L = {001, 1100, 10101}, then DM(L) = {01, 1001}. That is, even-length string 1100 is deleted, ... the language of regular expression ((0+1)(0+1))*. DM(L2) is regular; it is the language of regular expression (0+1)*.
The operation DM(L) is defined as follows:Throw away every even-length string from L.For each odd-length string, remove the middle character.For example, if L = {001, 110...
vijay_jr
1.7k
views
vijay_jr
asked
Dec 5, 2017
Theory of Computation
theory-of-computation
finite-automata
regular-expression
+
–
1
votes
1
answer
608
Reverse and Complement of a Reg lang represented by DFA
A regular lang is represented by a DFA. To find the reverse of the lang, we do the following: Change directions of arrows of state transitions and also interchange final <-> non-final states. A regular lang is ... reversing. So if there were two final states before then after reversing should both the states be "start state"?
A regular lang is represented by a DFA. To find the reverse of the lang, we do the following: Change directions of arrows of state transi...
Tuhin Dutta
2.3k
views
Tuhin Dutta
asked
Dec 4, 2017
Theory of Computation
theory-of-computation
finite-automata
+
–
1
votes
0
answers
609
Simple doubt in Reg Exp of TOC
why $bb^*$ is $b^*$ and not $b^+$? Ref: $a^*(bb^*a + a)a^*\\=a^*(bb^*+\epsilon)aa^*\\=a^*b^*aa^*\\=a^*b^*a^*a$
why $bb^*$ is $b^*$ and not $b^+$?Ref:$a^*(bb^*a + a)a^*\\=a^*(bb^*+\epsilon)aa^*\\=a^*b^*aa^*\\=a^*b^*a^*a$
Tuhin Dutta
413
views
Tuhin Dutta
asked
Dec 4, 2017
Theory of Computation
theory-of-computation
regular-expression
finite-automata
+
–
0
votes
0
answers
610
DFA and Reg Exp
$ L = \{ wxwy \ | \ \ x,y,w \ \ \epsilon\ ( a + b )^+ \} $ Draw the DFA and also write the Reg exp for the above language.
$ L = \{ wxwy \ | \ \ x,y,w \ \ \epsilon\ ( a + b )^+ \} $Draw the DFA and also write the Reg exp for the above language.
Tuhin Dutta
550
views
Tuhin Dutta
asked
Dec 4, 2017
Theory of Computation
regular-expression
finite-automata
theory-of-computation
+
–
2
votes
2
answers
611
Regular expression for single state FA without final state
Give the language and Regular Expression for this finite automaton. Is it a DFA or NFA? Can we draw a DFA without a single final state?
Give the language and Regular Expression for this finite automaton.Is it a DFA or NFA? Can we draw a DFA without a single final state?
Tuhin Dutta
781
views
Tuhin Dutta
asked
Dec 4, 2017
Theory of Computation
theory-of-computation
finite-automata
regular-expression
+
–
0
votes
1
answer
612
MadeEasy Test Series 2018: Theory Of Computation - Finite Automata
Let A be a NFA with epsilon transitions such that there are no transitions into q0 (start state) and no transitions out of qf (the accepting state). Let L be the language recognized by A. The above automata A' is modified by ... the modified A' in terms of L' will be : Same as L Accepts null Accepts universal language Accept L+
Let A be a NFA with epsilon transitions such that there are no transitions into q0 (start state) and no transitions out of qf (the accepting state). Let L be the language...
badmetevils
1.9k
views
badmetevils
asked
Dec 2, 2017
Theory of Computation
made-easy-test-series
theory-of-computation
finite-automata
+
–
0
votes
1
answer
613
Regular Expression from Finite Automata
Can someone please explain me how could we derive the RE from FA's ... Here-- https://gateoverflow.in/464/gate2008-52 PS- Obviously the answer can be easily obtained using parsing, but how can we derive the regular expression ... is too lengthy for exam point of view, so explanation with some other technique like state elimination will be appreciated...
Can someone please explain me how could we derive the RE from FA's ... Here https://gateoverflow.in/464/gate2008-52PS- Obviously the answer can be easily obtained using ...
Namit Dhupar
701
views
Namit Dhupar
asked
Dec 2, 2017
Theory of Computation
finite-automata
theory-of-computation
expression
regular-expression
+
–
2
votes
2
answers
614
DFA no of states
What is the min no. of states required in DFA which accepts all strings starting with 1 and whose decimal value is divisible by 7?
What is the min no. of states required in DFA which accepts all strings starting with 1 and whose decimal value is divisible by 7?
Tuhin Dutta
1.0k
views
Tuhin Dutta
asked
Nov 30, 2017
Theory of Computation
theory-of-computation
minimal-state-automata
finite-automata
+
–
0
votes
1
answer
615
DFA construction
Design a DFA that accepts all strings ending with three consecutive zeros over {0,1}
Design a DFA that accepts all strings ending with three consecutive zeros over {0,1}
dragonball
4.7k
views
dragonball
asked
Nov 29, 2017
Theory of Computation
theory-of-computation
finite-automata
+
–
0
votes
4
answers
616
MadeEasy Advance Level Test: Theory of Computation - Finite Automata
Answer given is 2,but shouldn't it be 3? State itself will be there in e-closure?
Answer given is 2,but shouldn't it be 3? State itself will be there in e-closure?
rahul sharma 5
1.1k
views
rahul sharma 5
asked
Nov 28, 2017
Theory of Computation
made-easy-test-series
theory-of-computation
finite-automata
+
–
2
votes
0
answers
617
DFA/NFA
Consider a NFA with 6 states, what will be minimum number of states in corresponding DFA? A)6 B)64 C)36 D)1
Consider a NFA with 6 states, what will be minimum number of states in corresponding DFA?A)6 B)64 C)36 D)1
srestha
686
views
srestha
asked
Nov 28, 2017
Theory of Computation
theory-of-computation
finite-automata
+
–
5
votes
1
answer
618
Stanford (Automata Theory)
The finite automaton above accepts no word of length zero, no word of length one, and only two words of length two (01 and 10). There is a fairly simple recurrence equation for the number N(k) of words of length k that this automaton accepts. Discover this recurrence ... by identifying the correct value of N(k) for some particular k. N(12)=10 N(12)=44 N(12)=50 N(13)=16
The finite automaton above accepts no word of length zero, no word of length one, and only two words of length two (01 and 10). There is a fairly simple recurrence equati...
vijay_jr
1.9k
views
vijay_jr
asked
Nov 27, 2017
Theory of Computation
theory-of-computation
finite-automata
+
–
0
votes
1
answer
619
Regular Expression
What will be the Regular Expression obtained from this Finite Automata?
What will be the Regular Expression obtained from this Finite Automata?
Namit Dhupar
566
views
Namit Dhupar
asked
Nov 25, 2017
Theory of Computation
theory-of-computation
regular-expression
finite-automata
+
–
0
votes
1
answer
620
MadeEasy Subject Test: Theory of Computation - Finite Automata
why my answer of Option B is wrong?
why my answer of Option B is wrong?
Kalpataru Bose
312
views
Kalpataru Bose
asked
Nov 24, 2017
Theory of Computation
made-easy-test-series
theory-of-computation
finite-automata
+
–
0
votes
1
answer
621
Regular and Non regular Language
if L1 = {anbn| n>=0} is not regular then how come L2 = {an|n>=0} is regular?
if L1 = {anbn| n>=0} is not regular then how come L2 = {an|n>=0} is regular?
Mk Utkarsh
515
views
Mk Utkarsh
asked
Nov 23, 2017
Theory of Computation
theory-of-computation
regular-language
finite-automata
+
–
3
votes
2
answers
622
Need help to draw a DFA from a Right Linear grammar
.............................................................. .
...............................................................
Tuhin Dutta
2.3k
views
Tuhin Dutta
asked
Nov 22, 2017
Theory of Computation
theory-of-computation
finite-automata
regular-grammar
+
–
0
votes
2
answers
623
TOC:- DFA
Consider the following NFA:- How many final states required in the equivalent DFA?
Consider the following NFA:-How many final states required in the equivalent DFA?
rahul sharma 5
1.0k
views
rahul sharma 5
asked
Nov 20, 2017
Theory of Computation
theory-of-computation
finite-automata
number-of-states
+
–
0
votes
2
answers
624
GateForum
Consider the language L represented by the regular expression 01[((10)*+111)*+0]*1
Consider the language L represented by the regular expression 01[((10)*+111)*+0]*1
Mk Utkarsh
4.1k
views
Mk Utkarsh
asked
Nov 18, 2017
Theory of Computation
gateforum-test-series
theory-of-computation
finite-automata
+
–
2
votes
4
answers
625
TOC Sample practice
$L1 = \{a^m b^nc^{max(m,n)} : m,n > 1\}$ $L2 = \{a^{2^n}, n > 1\} \cup \{a^m, m>1\}$ (a) Both are regular (b) Only L2 is regular (c) Only L1 is regular (d) None of the above Solution: Option (b) how? here as l2 is not in ap it should not be regular right?
$L1 = \{a^m b^nc^{max(m,n)} : m,n 1\}$ $L2 = \{a^{2^n}, n 1\} \cup \{a^m, m>1\}$(a) Both are regular (b) Only L2 is regular(c) Only L1 is regular (d) None of the ...
Pranav Madhani
1.1k
views
Pranav Madhani
asked
Nov 17, 2017
Theory of Computation
theory-of-computation
finite-automata
userisi
isisamplepapers
+
–
1
votes
1
answer
626
Minimum DFA Construction
Construct the minimum DFA accepting language L over {a, b} where the 5th symbol and the 10th symbol from LHS is different. It is given that the minimum DFA has 12 states. But I am getting many more states. Could someone please provide a diagram that involves only 12 states?
Construct the minimum DFA accepting language L over {a, b} where the 5th symbol and the 10th symbol from LHS is different. It is given that the minimum DFA has 12 states....
humblefool
950
views
humblefool
asked
Nov 16, 2017
Theory of Computation
theory-of-computation
minimal-state-automata
finite-automata
number-of-states
+
–
0
votes
1
answer
627
Gate Academy
Regular Expression of the NFA : A. 2*(0+12*)* B. 2*(0+2*)1* C. 2*(0+ 12*) D. 2*(01+12)*
Regular Expression of the NFA :A. 2*(0+12*)*B. 2*(0+2*)1*C. 2*(0+ 12*)D. 2*(01+12)*
Saikat Dutta
366
views
Saikat Dutta
asked
Nov 15, 2017
Theory of Computation
finite-automata
+
–
1
votes
0
answers
628
Number of states in DFA
L = {s ∈ (0 + 1)* d(s)mod5 = 2 or d(s)mod7 != 4} where d(s) is the decimal equivalent of the binary string s. How many states does the above DFA have? How many final states? Please explain your answer.
L = {s ∈ (0 + 1)* d(s)mod5 = 2 or d(s)mod7 != 4} where d(s) is the decimal equivalent of the binary string s.How many states does the above DFA have? How many final sta...
Warlock lord
2.2k
views
Warlock lord
asked
Nov 12, 2017
Theory of Computation
theory-of-computation
finite-automata
number-of-states
+
–
2
votes
1
answer
629
TOC :- Number of states in DFA
Minimum number of states in DFA where:, Number of a's and Number of b's are even and epsilon is not accepted.Langugae is defined over {a,b}
Minimum number of states in DFA where:, Number of a's and Number of b's are even and epsilon is not accepted.Langugae is defined over {a,b}
rahul sharma 5
936
views
rahul sharma 5
asked
Nov 9, 2017
Theory of Computation
theory-of-computation
finite-automata
minimal-state-automata
number-of-states
+
–
0
votes
2
answers
630
NUMBER OF STATES IN DFA
Parshu gate
1.6k
views
Parshu gate
asked
Nov 6, 2017
Theory of Computation
finite-automata
theory-of-computation
number-of-states
+
–
Page:
« prev
1
...
16
17
18
19
20
21
22
23
24
25
26
...
35
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register