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
Recent questions tagged theory-of-computation-
1
vote
0
answers
1
Dfa for no states
What is the difference between a dfa accepting epsilon moves and dfa accepting nothing? I have a dfa which has no states what will be the dfa this is regarding,this question https://gateoverflow.in/8362/gate2015-1-52
sripo
asked
in
Theory of Computation
Oct 17, 2018
by
sripo
1.3k
views
minimal-state-automata
theory-of-computation
finite-automata
number-of-states
theory-of-computation-
1
vote
1
answer
2
Minimum No of states in DFA
No. of states in the DFA accepting the following set of strings are: ( ( aa* + φ* )* (aa* + φ* ) + bb* + φ* φ + φ* )* Quite confusing to me. Share your approach!
Prajwal Bhat
asked
in
Theory of Computation
Jan 17, 2017
by
Prajwal Bhat
1.3k
views
theory-of-computation
minimal-state-automata
finite-automata
theory-of-computation-
2
votes
1
answer
3
Counting No of States in the DFA
Minimum number of states required to construct DFA accepting language L={ w | w has even no of 0's and 1's and odd no of 3's } over alphabet { 0,1,2,3 } The answer given is 8. Should not the ans be 16? Using the ... 2 can take either one. Is it possible to get 8 states after minimization for the above DFA? Any simpler way of finding that logically?
yg92
asked
in
Theory of Computation
Jan 1, 2017
by
yg92
4.8k
views
minimal-state-automata
finite-automata
theory-of-computation-
theory-of-computation
5
votes
6
answers
4
Minimized DFA no of states || Peter Linz
$L = \left \{ a^nb \ ; n\geq 0 \right \} \cup \left \{ b^na \ ; n\geq 1 \right \}$ Minimal DFA for the above language ?
dd
asked
in
Theory of Computation
Sep 24, 2016
by
dd
3.1k
views
theory-of-computation
minimal-state-automata
finite-automata
theory-of-computation-
4
votes
3
answers
5
Minimum number of states in DFA
Let k>=2, let L be the set of strings in (0,1)* such that x belongs to L if the number of 0's in x is divisible by k and the number of 1's in x is odd. The minimum number of states in a deterministic finite automata (DFA) that recognizes L is (a) k+2 (b) 2k (c) k log k (d) 2^k
ayushigupta
asked
in
Theory of Computation
Aug 4, 2016
by
ayushigupta
4.1k
views
theory-of-computation-
minimal-state-automata
To see more, click for the
full list of questions
or
popular tags
.
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 questions tagged theory-of-computation-
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:...