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 ad140
0
votes
1
MadeEasy Test Series: Theory Of Computation - Finite Automata
Let L = {(aP)*⎪P is a prime number} and Σ={a}. The minimum number of states in NFA that accepts the language L are ________. i don't think it is even a regular language. then how can NFA be generated?
Let L = {(aP)*⎪P is a prime number} and Σ={a}. The minimum number of states in NFA that accepts the language L are ________.i don't think it is even a regular language...
2.2k
views
answered
Nov 1, 2018
Theory of Computation
made-easy-test-series
theory-of-computation
finite-automata
+
–
0
votes
2
geeksforgeeks site
Consider the Deterministic Finite Automaton for input alphabets Σ = {a, b} L = The number of final state(s) will be (A) 2 (B) 1 (C) 3 (D) 6
Consider the Deterministic Finite Automaton for input alphabets Σ = {a, b}L = The number of final state(s) will be(A) 2(B) 1(C) 3(D) 6
955
views
answered
Sep 14, 2018
Theory of Computation
theory-of-computation
+
–
0
votes
3
MADE EASY TEST SERIES
Consider the following schedules involving two transactions. $S_1 : R_1(x), W_2(y),R_2(x),W_1(y), \ commit_1, \ commit_2$ $S_2 : R_1(x), R_2(y),W_1(z), \ commit_1,R_3(y), R_3(z), W_2(y), W_3(x), commit_2, commit_3$ Which of the following ... S2 are allowed under 2PL B) only S1 is allowed under 2PL C) only S2 is allowed under 2PL D) neither S1 nor S2 is allowed under 2PL
Consider the following schedules involving two transactions.$S_1 : R_1(x), W_2(y),R_2(x),W_1(y), \ commit_1, \ commit_2$$S_2 : R_1(x), R_2(y),W_1(z), \ commit_1,R_3(y), R...
3.5k
views
answered
Aug 30, 2018
Databases
transaction-and-concurrency
+
–
0
votes
4
Linked list
What are sequential access structures? Are arrays or linked list the sequential access structures?
What are sequential access structures? Are arrays or linked list the sequential access structures?
3.3k
views
answered
Aug 30, 2018
Programming in C
data-structures
+
–
0
votes
5
Made Easy Computer Networks
A supernet has first address of 205.16.32.0 and a supernet mask of 255.255.248.0. How many blocks are in this supernet and what is the range of addresses?
A supernet has first address of 205.16.32.0 and a supernet mask of 255.255.248.0. How many blocks are in this supernet and what is the range of addresses?
3.6k
views
answered
Aug 30, 2018
Computer Networks
computer-networks
supernetting
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
