Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by suryaprakash
0
votes
61
#TOC what does this statement means?
input {0,1} Set of all strings that begin and end with either 0 or 1. What does this statement/line means and what would be the R.E for this?
input {0,1} Set of all strings that begin and end with either 0 or 1. What does this statement/line means and what would be the R.E for this?
2.3k
views
answered
Jan 14, 2018
Theory of Computation
regular-expression
finite-automata
+
–
0
votes
62
#TOC what will be the Regular Expression of this?
input {a,b} Write R.E where every b is followed by at least 2 K a's? (K is +ve integer)
input {a,b} Write R.E where every b is followed by at least 2 K a's? (K is +ve integer)
986
views
answered
Jan 14, 2018
Theory of Computation
regular-expression
+
–
0
votes
63
Theory Of Computation
What is the regular expression for this E-NFA:-
What is the regular expression for this E-NFA:-
548
views
answered
Jan 14, 2018
Theory of Computation
theory-of-computation
finite-automata
regular-expression
+
–
0
votes
64
TOPIC : REGULAR EXPRESSIONS,
1.One of the following Regular Expressions is not the same as others. Which one? A. (a* + b*a*)* B. (a*b* + b*a*)* (a*b*)* C. ((ab)* + a*)* D. (a + b)* a*b*a*b*
1.One of the following Regular Expressions is not the same as others. Which one? A. (a* + b*a*)* B. (a*b* + b*a*)* (a*b*)* C. ((ab)* + a*)* D. (a + b...
4.1k
views
answered
Jan 14, 2018
Theory of Computation
regular-expression
theory-of-computation
finite-automata
regular-language
+
–
–2
votes
65
GATE CSE 2008 | Question: 52
Match the following NFAs with the regular expressions they correspond to: P Q R S $\epsilon + 0\left(01^*1+00\right)^*01^*$ $\epsilon + 0\left(10^*1+00\right)^*0$ $\epsilon + 0\left(10^*1+10\right)^*1$ $\epsilon + 0\left(10^*1+10\right)^*10^*$ $P-2, Q-1, R-3, S-4$ $P-1, Q-3, R-2, S-4$ $P-1, Q-2, R-3, S-4$ $P-3, Q-2, R-1, S-4$
Match the following NFAs with the regular expressions they correspond to: P Q R S $\epsilon + 0\left(01^*1+00\right)^*01^*$$\epsilon + 0\left(10^*1+00\right)^*0$$\epsilon...
12.7k
views
answered
Jan 14, 2018
Theory of Computation
gatecse-2008
theory-of-computation
finite-automata
normal
+
–
0
votes
66
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?
834
views
answered
Jan 14, 2018
Theory of Computation
theory-of-computation
finite-automata
regular-expression
+
–
0
votes
67
[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.
1.3k
views
answered
Jan 14, 2018
Theory of Computation
theory-of-computation
finite-automata
regular-expression
+
–
0
votes
68
DFA from reg ex
Construct a finite automata from 0*1*1 + 11*0*1
Construct a finite automata from 0*1*1 + 11*0*1
459
views
answered
Jan 14, 2018
Theory of Computation
theory-of-computation
finite-automata
+
–
–1
votes
69
regular expressions
Answer is c. but i think it should be b as r1 = (0+1)* = r2=r3. please correct me if i m wrong
Answer is c. but i think it should be b as r1 = (0+1)* = r2=r3. please correct me if i m wrong
754
views
answered
Jan 14, 2018
Theory of Computation
theory-of-computation
regular-expression
regular-language
finite-automata
+
–
0
votes
70
#TOC DFA Query
If these 2 states can be merged please tell HOW?
If these 2 states can be merged please tell HOW?
312
views
answered
Jan 12, 2018
Theory of Computation
theory-of-computation
finite-automata
+
–
0
votes
71
Is there SR conflict in SLR(1) ?
2.3k
views
answered
Aug 27, 2017
Compiler Design
compiler-design
parsing
test-series
+
–
0
votes
72
Testbook
I think follow(A) is given wrong. I am getting follow(A) = {first (B), follow(S)} = {e, $}
I think follow(A) is given wrong. I am gettingfollow(A) = {first (B), follow(S)} = {e, $}
610
views
answered
Aug 22, 2017
Compiler Design
parsing
testbook-test-series
+
–
0
votes
73
PARSING
ARE NUMBER OF SHIFT ENTRIES / ACTIONS IN PARSING TABLE OF SLR(1) AND LALR(1) SAME ALWAYS??
ARE NUMBER OF SHIFT ENTRIES / ACTIONS IN PARSING TABLE OF SLR(1) AND LALR(1) SAME ALWAYS??
2.7k
views
answered
Aug 22, 2017
Compiler Design
compiler-design
parsing
grammar
ll-parser
+
–
0
votes
74
Complier Design Test 1.1
Ques. S --> Aa/bAc/dc A --> d Which of them is correct. Please provide detailed information. a) LALR(1) but not SLR(1) b) Both SLR(1) and LALR(1) c) Grammar is Ambiguous d) Neither SLR(1) NOR LALR(1)
Ques. S Aa/bAc/dc A dWhich of them is correct. Please provide detailed information.a) LALR(1) but not SLR(1)b) Both SLR(1) and LALR(1)c) Grammar is Ambiguo...
900
views
answered
Aug 14, 2017
Compiler Design
compiler-design
parsing
lr-parser
ambiguous-grammar
test-series
+
–
Page:
« prev
1
2
3
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register