Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
#aktu university
Nitesh_Yadav
asked
in
Theory of Computation
Jan 11, 2022
90
views
0
votes
0
votes
Solve this question
theory-of-computation
finite-automata
Nitesh_Yadav
asked
in
Theory of Computation
Jan 11, 2022
by
Nitesh_Yadav
90
views
answer
comment
Follow
share this
share
0 Comments
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
0
Answers
← Previous
Next →
← Previous in category
Next in category →
Related questions
0
votes
0
votes
1
answer
1
Nitesh_Yadav
asked
in
Algorithms
Dec 29, 2021
167
views
#aktu #aktu 2016-17
please provide the solution
Nitesh_Yadav
asked
in
Algorithms
Dec 29, 2021
by
Nitesh_Yadav
167
views
algorithms
knapsack-problem
2
votes
2
votes
2
answers
2
Ash666
asked
in
Theory of Computation
Sep 13, 2021
889
views
KTU University Exam 2021
Let r1=(0+1)*, r2=0*1+10*+0*+1*. What is the length of the smallest string that is present in language corresponds to regular expression r1 and not present in language corresponds to regular expression r2. 2 3 1 none of the above
Ash666
asked
in
Theory of Computation
Sep 13, 2021
by
Ash666
889
views
theory-of-computation
regular-expression
regular-language
regular-grammar
0
votes
0
votes
1
answer
3
Silver_Reaper
asked
in
Theory of Computation
Jan 28
37
views
An Introduction to Formal Languages and Automata,6th edition,Exercise 2.3 Q2.
Convert the nfa in Exercise 13, Section 2.2, into an equivalent dfa.
Silver_Reaper
asked
in
Theory of Computation
Jan 28
by
Silver_Reaper
37
views
theory-of-computation
peter-linz
finite-automata
0
votes
0
votes
0
answers
4
Silver_Reaper
asked
in
Theory of Computation
Jan 24
32
views
An Introduction to Formal Languages and Automata Peter Linz 6th Edition.Exercise 2.1 4 d,e
For Σ = {a, b}, construct dfa’s that accept the sets consisting of: (d) all strings with at least one b and exactly two a’s. (e) all the strings with exactly two a’s and more than three b’s.
Silver_Reaper
asked
in
Theory of Computation
Jan 24
by
Silver_Reaper
32
views
theory-of-computation
peter-linz
finite-automata
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
GATE CSE 2023 Paper & Analysis - Memory Based
From GATE to Australia
DRDO Previous Year Papers
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
What are the key things to focus on during the final 10-15 days before the GATE exam to improve performance?
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.9k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.6k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(649)
Exam Queries
(842)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(853)
Recent Blog Comments
@Aakash_Bhardwaj all the best bro . For your...
What's the answer for keystroke question
Same,easy to moderate
I felt paper was very much like AIMT 3!!
very easy paper, I don't want to discuss paper...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy