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 DFA of all string whose binary interpretation are divisible by 5
Parth Sharma
asked
in
Theory of Computation
Jan 28, 2017
852
views
1
vote
1
vote
draw DFA of all string whose binary interpretation are divisible by 5
Parth Sharma
asked
in
Theory of Computation
Jan 28, 2017
by
Parth Sharma
852
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
3
votes
3
votes
Best answer
Draw yourself .
transition table. -
0
1
q0
q0
q1
q1
q2
q3
q2
q4
q0
q3
q1
q2
q4
q3
q4
Tendua
answered
Jan 28, 2017
selected
Jan 28, 2017
by
Sushant Gokhale
by
Tendua
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
1
answer
1
M_Umair_Khan42900
asked
in
Theory of Computation
Dec 29, 2022
2,090
views
Write regular expression to denote a language L a) String which begin or end with either 00 or 11. b) The set of all strings, when viewed as binary representation of integers, that are divisible by 2. c) The set of all strings containing 00. d) String not containing the substring 110.
M_Umair_Khan42900
asked
in
Theory of Computation
Dec 29, 2022
by
M_Umair_Khan42900
2.1k
views
theory-of-computation
regular-expression
finite-automata
pushdown-automata
minimal-state-automata
computer
0
votes
0
votes
0
answers
2
prince123
asked
in
Theory of Computation
Dec 11, 2016
746
views
below are images showing two minimal dfa accepting binary string divisible by 2 my question is which one is right.
prince123
asked
in
Theory of Computation
Dec 11, 2016
by
prince123
746
views
3
votes
3
votes
1
answer
3
Vinil
asked
in
Theory of Computation
Sep 16, 2017
5,027
views
No of states in finite automata whose string length is divisible by 3 or 8 ?
No of states in finite automata whose string length is divisible by 3 or8?
Vinil
asked
in
Theory of Computation
Sep 16, 2017
by
Vinil
5.0k
views
finite-automata
theory-of-computation
14
votes
14
votes
5
answers
4
Vikrant Singh
asked
in
Theory of Computation
Feb 1, 2015
4,348
views
No. of states in the minimal finite automata which accepts the binary strings whose equivalent is divisible by 32 is ________?
Vikrant Singh
asked
in
Theory of Computation
Feb 1, 2015
by
Vikrant Singh
4.3k
views
theory-of-computation
finite-automata
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy
