Awesome q2a theme
Ask us anything
Toggle navigation
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Exams
Recent questions tagged #dfa
0
votes
1
answer
self doubt on toc finit automata
What will be the number of states in minimal DFA, if every string contains aa and bb as substring ?
asked
Mar 20
in
Theory of Computation
by
Sankalp Singh 1
(
6
points)

20
views
#dfa
finiteautomata
theoryofcomputation
0
votes
1
answer
Automata  DFA
In what cases we need to include epsilon in DFA.
asked
Feb 18
in
Theory of Computation
by
pppankajsaini
(
8
points)

23
views
#dfa
theoryofcomputation
#toc
+1
vote
1
answer
RBR Test series (TOC)
Consider the language L={<M,w>  M is DFA and w is palindrome accepted by M } 1.L is regular. 2. L is CFL but not regular. 3.L is recursive. 4.L is recursively enumerable but not recursive. Isn’t this L = set of all DFA’s which accept palindrome…. So L should be Empty language … and therefore it should be Regular. or am I approaching it wrong?
asked
Dec 17, 2019
in
Theory of Computation
by
Priyansh Singh
(
257
points)

59
views
#dfa
0
votes
0
answers
DFA/NFA MINIMUM NUMBER OF STATES
How to decide minimum when will DFA have N+2 or N+1 states? https://gateoverflow.in/39562/gate2016216 https://gateoverflow.in/8256/gate2015253 https://gateoverflow.in/118302/gate2017122 https://gateoverflow.in/118160/gate2017225 above 2 are cases for N+1 and latter are N+2
asked
Dec 6, 2019
in
Theory of Computation
by
Asim Siddiqui 4
(
8
points)

7
views
theoryofcomputation
finiteautomata
#dfa
#toc
0
votes
1
answer
Self Doubt (T.o.c)
What is Minimal dfa for → (0*1+1*)
asked
Nov 8, 2019
in
Theory of Computation
by
Priyansh Singh
(
257
points)

29
views
#dfa
#toc
0
votes
0
answers
Self doubt ( TOC )
A DFA with multiple final states, cannot be converted to DFA with single final state. Is it True?
asked
Nov 7, 2019
in
Theory of Computation
by
Priyansh Singh
(
257
points)

47
views
#dfa
0
votes
1
answer
Ace booklet question on dfa
The minimal finite automata for the set of all strings over $(0+1+2)^*$ that interpreted as integer representation of a base 3 number as congruent to 5 modulo 6 has a) 5 b) 6 c) 7 d) none I am getting $6$ but the answer given is none of these.
asked
Oct 12, 2019
in
Theory of Computation
by
`JEET
(
179
points)

35
views
#dfa
#toc
#dfadesign
0
votes
1
answer
How many dfa's exist? [Gate Academy TOC Topic Test Finite automata]
asked
Sep 12, 2019
in
Theory of Computation
by
Sathuri Bharath
(
74
points)

12
views
theoryofcomputation
#dfa
+1
vote
1
answer
How atleast become 2^n?
Given An arbitary nondeterministic finite automation with N states,the maximum numer of states in an equivalent minimized DFA is atleast?
asked
Aug 19, 2019
in
Theory of Computation
by
bibin765
(
7
points)

12
views
#toc
#dfa
nfa
#gate2001
#gate
0
votes
0
answers
NO. OF STATES(DFA)
Construct a DFA having no. of c’s divisible by a or divisible by b. Having alphabet ={c} For such a question do we have any closed form formula?
asked
Aug 17, 2019
in
Theory of Computation
by
Doraemon
(
100
points)

23
views
#dfa
0
votes
1
answer
Number of states in DFA
1. A minimal DFA accepting the language $L = \{ww ∈ (a,b,c) ^∗\}$, the number of a’s, b’s and c’s in w are divisible by $2, 3$ and $4$ respectively has ________ number of states Answer is given as 24 but isn’t 12 (lcm of 2,3,4) enough?
asked
Aug 10, 2019
in
Theory of Computation
by
DukeThunders
(
415
points)

30
views
#toc
#dfa
0
votes
1
answer
No. of states in minimum DFA for given Regular Expression
asked
Jul 22, 2019
in
Theory of Computation
by
kshubham538
(
5
points)

25
views
#regularlanguage
#dfa
#toc
#madeeasyworkbook
0
votes
1
answer
Language recognition by DFA
asked
Jul 20, 2019
in
Theory of Computation
by
kshubham538
(
5
points)

12
views
#regularlanguage
theoryofcomputation
#dfa
0
votes
1
answer
How many states are there in a minimum state deterministic finite automata accepting L={ba,baa}?
asked
Jul 15, 2019
in
Theory of Computation
by
kshubham538
(
5
points)

33
views
#toc
#dfa
#regularlanguage
#madeeasyworkbook
0
votes
0
answers
Deterministic finite automata
Consider C1:For $DFA(\phi,\Sigma^*,\delta,q0,F)$ if $F = \phi$ then $L = \Sigma$ closure is it right???
asked
Jul 1, 2019
in
Theory of Computation
by
Manmade
(
10
points)

6
views
theoryofcomputation
dfas
#dfa
#dfadesign
To see more, click for the
full list of questions
or
popular tags
.
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
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Top Users
Apr 2020
!KARAN
36 Points
lazygatestudent
5 Points
AngeloAlba89
5 Points
WillKnisley
5 Points
TamieMcvay4
5 Points
Satyaki Das
5 Points
akansha03
5 Points
Doraemon
3 Points
srestha
3 Points
Shivateja MST
2 Points
Monthly Top User and those within 60% of his/her points will get a share of monthly revenue of GO subject to a minimum payout of Rs. 500. Current monthly budget for Top Users is Rs. 75.
3,513
questions
1,656
answers
10,451
comments
90,037
users