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
Draw a DFA (Deterministic Finite Automation) that has a its thrid to last digit as a 1
rohankrishan
asked
in
Theory of Computation
Jun 30, 2022
recategorized
Jul 3, 2022
by
Shubham Sharma 2
125
views
0
votes
0
votes
Examples that work: 100, 0000000101,110101010101
This DFA requires at least 8 states
theory-of-computation
finite-automata
rohankrishan
asked
in
Theory of Computation
Jun 30, 2022
recategorized
Jul 3, 2022
by
Shubham Sharma 2
by
rohankrishan
125
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.
1
Answer
0
votes
0
votes
Regular expression:
(0+1)*1(0+1)(0+1)
NFA:
construct the state transition table of the above NFA.
abhinowKatore
answered
Jun 30, 2022
edited
Jun 30, 2022
by
abhinowKatore
by
abhinowKatore
comment
Follow
share this
0 Comments
Please
log in
or
register
to add a comment.
← Previous
Next →
← Previous in category
Next in category →
Related questions
1
vote
1
vote
2
answers
1
rohankrishan
asked
in
Theory of Computation
Jul 1, 2022
274
views
Draw a DFA (Deterministic Finite Automation) in which first two bits are the same as the last two bits
rohankrishan
asked
in
Theory of Computation
Jul 1, 2022
by
rohankrishan
274
views
finite-automata
theory-of-computation
0
votes
0
votes
2
answers
2
rohankrishan
asked
in
Theory of Computation
Jun 30, 2022
120
views
Draw a DFA (Deterministic Finite Automation) that has a total number of zeros in the string divisble by two and three.
rohankrishan
asked
in
Theory of Computation
Jun 30, 2022
by
rohankrishan
120
views
theory-of-computation
finite-automata
4
votes
4
votes
1
answer
3
Aakanchha
asked
in
Theory of Computation
May 22, 2015
4,082
views
Build an FA that accepts the language of all strings of a's and b's such that next-to-last letter is an a
Aakanchha
asked
in
Theory of Computation
May 22, 2015
by
Aakanchha
4.1k
views
theory-of-computation
finite-automata
0
votes
0
votes
1
answer
4
Garrett McClure
asked
in
Theory of Computation
Sep 6, 2017
3,472
views
Theory of Computation - Deterministic Finite Automation and Strings
For Σ = {a, b}, construct a DFA that accepts the sets consisting of: all the strings with an even number of a’s and the number of b’s is a multiple of 3. Note that 0 is an even number and a multiple of 3.
Garrett McClure
asked
in
Theory of Computation
Sep 6, 2017
by
Garrett McClure
3.5k
views
theory-of-computation
finite-automata
strings
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
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?
All India GO Classes Mock test
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
Yes, CDU provides assistance for internships...
Are you fully aware of the job opportunities in...
When this exam will happen ?
Can Someone guide me how to prepare for interview...
It's not a standard resource, don't follow them.
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy
