Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Webpage for Theory of Computation:
Recent questions tagged theory-of-computation
0
votes
0
answers
91
Theory of Computation
L = a^n / n is odd number is a Regular language but by checking it with pumping lemma it’s getting as Not Regular.why? https://gateoverflow.in/?qa=blob&qa_blobid=15872129177586526309
L = a^n / n is odd number is a Regular languagebut by checking it with pumping lemma it’s getting as Not Regular.why?https://gateoverflow.in/?qa=blob&qa_blobid=158721...
jay14
187
views
jay14
asked
Sep 18, 2023
Theory of Computation
theory-of-computation
query
+
–
0
votes
1
answer
92
Internet
Consider the following language definition: L= {(M) | M is a DFA and M accepts some string of the form ww^R for some w€ Σ L is A. Regular B. Context-free but not regular C. Recursive but not context-free D. Recursively enumerable but not recursive
Consider the following language definition:L= {(M) | M is a DFA and M accepts some string of the form ww^R for some w€ ΣL isA. RegularB. Context-free but not regularC....
Biswajit Kumar
195
views
Biswajit Kumar
asked
Sep 13, 2023
Theory of Computation
theory-of-computation
+
–
0
votes
1
answer
93
#Gate CS Applied Course
is this correct DFA ?
is this correct DFA ?
Dknights
218
views
Dknights
asked
Sep 12, 2023
Theory of Computation
theory-of-computation
+
–
0
votes
1
answer
94
1 State DFA
There is one and only one finite language that can be accepted by a 1-state DFA. True or False? Explain.
There is one and only one finite language that can be accepted by a 1-state DFA. True or False? Explain.
Deepak Poonia
238
views
Deepak Poonia
asked
Sep 11, 2023
Theory of Computation
theory-of-computation
+
–
1
votes
1
answer
95
Minimal Finite Automata - Theory of Computation
Consider the set of all binary strings where the difference between the number of 0’s and number of 1’s is even. The minimum number of states in a DFA that accepts the given set is _____________? (kindly explain the approach to this problem)
Consider the set of all binary strings where the difference between the number of 0’s and number of 1’s is even. The minimum number of states in a DFA that accepts th...
stillhere
369
views
stillhere
asked
Sep 10, 2023
Theory of Computation
minimal-state-automata
finite-automata
theory-of-computation
number-of-states
+
–
1
votes
1
answer
96
Applied Roots TOC practice set 2 2019
iam.sahilpatra
137
views
iam.sahilpatra
asked
Sep 9, 2023
Theory of Computation
theory-of-computation
number-of-dfa
+
–
1
votes
1
answer
97
Self Doubt from GoClasses Test Series
If L= { a^p | where p is any prime number }, then what is:- i) L+ ii) L* iii)L^3
If L= { a^p | where p is any prime number }, then what is:- i) L+ ii) L*iii)L^3
Swarnava Bose
250
views
Swarnava Bose
asked
Aug 26, 2023
Theory of Computation
theory-of-computation
regular-language
context-free-language
+
–
1
votes
2
answers
98
physics wallah question
$L_1=a^ * b^ *$ $L_2=a^ + b^ +$ Find $L_2-L_1$: A. $a ^ *$ B. $b ^ *$ C. $a ^ * +b^ *$ D. None
$L_1=a^ * b^ *$$L_2=a^ + b^ +$Find $L_2-L_1$:A. $a ^ *$B. $b ^ *$C. $a ^ * +b^ *$D. None
gateranker
379
views
gateranker
asked
Aug 25, 2023
Theory of Computation
theory-of-computation
physicswallah
+
–
0
votes
1
answer
99
made easy test series 2023 question
Let r = a(a + b)*, S = aa*b and t = a* b be three regular expressions. Consider the following: Which one of them is correct ?
Let r = a(a + b)*, S = aa*b and t = a* b be three regular expressions. Consider the following:Which one of them is correct ?
kaustubh7
375
views
kaustubh7
asked
Aug 24, 2023
Theory of Computation
theory-of-computation
regular-expression
+
–
0
votes
1
answer
100
made easy test series 2023 toc question
How many states are there in a minimum state DFA accepting the language number of 0’s is divisible by 2 and number of 1’s is divisible by 7, respectively?
How many states are there in a minimum state DFA accepting the language number of 0’s is divisible by 2 and number of 1’s is divisible by 7, respectively?
kaustubh7
359
views
kaustubh7
asked
Aug 24, 2023
Theory of Computation
theory-of-computation
+
–
0
votes
2
answers
101
Made Easy Book
114
114
suryansh rajput
332
views
suryansh rajput
asked
Aug 21, 2023
Theory of Computation
theory-of-computation
+
–
0
votes
0
answers
102
TOC Decidibility
Çșȇ ʛấẗẻ
101
views
Çșȇ ʛấẗẻ
asked
Aug 14, 2023
Algorithms
theory-of-computation
+
–
0
votes
1
answer
103
#regularexpressions #Theoryofcomputation
L = (a+b)$\small ^*$b is equivalent to ____________? A. (ab$\small^*$)$\small^+$ B. (a$\small^+$b$\small^*$)$\small^+$ C. b$\small^*$(ab$\small^*$)$\small^*$b D. None
L = (a+b)$\small ^*$b is equivalent to ____________?A. (ab$\small^*$)$\small^+$B. (a$\small^+$b$\small^*$)$\small^+$C. b$\small^*$(ab$\small^*$)$\small^*$bD. None
D_i_b_y_a prakash
400
views
D_i_b_y_a prakash
asked
Aug 13, 2023
Theory of Computation
theory-of-computation
regular-expression
+
–
1
votes
1
answer
104
#Theoryofcomputation #regularexpressions
A = aa* and B = bb* ( A U B) * =? 1.{ a^nb^n | n >= 0} 2.{ a^mb^n | m, n >=0} 3.(a+b)* 4.None
A = aa* and B = bb*( A U B) * =? 1.{ a^nb^n | n >= 0}2.{ a^mb^n | m, n >=0}3.(a+b)*4.None
D_i_b_y_a prakash
351
views
D_i_b_y_a prakash
asked
Aug 12, 2023
Theory of Computation
theory-of-computation
regular-expression
+
–
0
votes
1
answer
105
Regular Expresssion I need help in this ??
Çșȇ ʛấẗẻ
272
views
Çșȇ ʛấẗẻ
asked
Aug 9, 2023
Theory of Computation
self-doubt
theory-of-computation
+
–
0
votes
0
answers
106
Theory Of Computation General Doubt
Let h : {0, 1}∗ → {a, b}∗ be the function defined by h(e) = e, h(0) = aa and h(1) = b, and for words of length two or greater: h(a1a2 . . . an) = h(a1)h(a2) . . . h(an) for n ≥ 2 and ai ∈ {0, 1}. For a language L ⊆ {0, 1}∗ we define h(L) ... over {a, b} that corresponds to h(L): (i) L = {0m1n | m, n ≥ 0}. (ii) L = {w ∈ {0, 1}∗ | w contains 010 as a subword}.
Let h : {0, 1}∗ → {a, b}∗ be the function defined by h(e) = e, h(0) = aa and h(1) = b,and for words of length two or greater:h(a1a2 . . . an) = h(a1)h(a2) . . . h(a...
Shaina Singh
206
views
Shaina Singh
asked
Aug 9, 2023
Theory of Computation
theory-of-computation
+
–
0
votes
1
answer
107
Automation exam in the Faculty of Informatics Engineering, Damascus University
What is the regular expression that accept following string aaaabbbb ؟ a) a+ b+ b) a* b* c) (a+b)* (a+b)* d) (a+b)* e) abab
What is the regular expression that accept following string aaaabbbb ؟a) a+ b+b) a* b*c) (a+b)* (a+b)*d) (a+b)*e) abab
Mohamad
232
views
Mohamad
asked
Aug 8, 2023
Theory of Computation
theory-of-computation
regular-expression
+
–
Page:
« prev
1
2
3
4
5
6
7
8
9
...
155
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register