The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
finite autometa
0
votes
215
views
for a FA of n state the maximum length of string that must be consider to distinguish two states is:
a:n
b:n1
c:n2
d:none
asked
Dec 13, 2016
in
Theory of Computation
by
Hira Thakur
Boss

215
views
answer
comment
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
0
Answers
← Prev.
Next →
← Prev. Qn. in Sub.
Next Qn. in Sub. →
Related questions
0
votes
0
answers
1
finite autometa
the number of state of the FSM required to simulate the behavior of a computer with a memory capable of storing m words each of length is n bit is: 1) m*2^n 2)2^mn 3)2^mn 4)2^m+n
asked
Sep 3, 2017
in
Theory of Computation
by
Hira Thakur
Boss

94
views
finiteautomata
0
votes
0
answers
2
theory of autometa
let M be a finite autometa .let M' denote the machine obtained by interchanging the final and non final state L(M) U L(M') =sigma* L(M) $\cap$ L(M') =$\Phi$ how many statement is true and answer is both are true . no need to read the ... have to make non final state to final state and final to non final and no other change now the the correct image is so both statement is true
asked
Jan 11, 2019
in
Theory of Computation
by
Gurdeep Saini
Boss

74
views
finiteautomata
theoryofcomputation
regularlanguages
regularexpressions
easy
0
votes
0
answers
3
compound autometa
In compound automta we doing cross product for and/or opearion My doubt is that supose there is lang L1 which we can drw DFA for tht & another lang for which we r unable to draw dfa but draw nfa is possible. While performing cross product is necessery that ... in dfa there is Dead state is also so what about Dead state?? Is dead state is participating on cross product of FA???
asked
Sep 12, 2016
in
Theory of Computation
by
Hira Thakur
Boss

117
views
+3
votes
3
answers
4
Ace Test Series: Theory Of Computation  Finite Automata
How many $2$ state DFA’s with the designated initial state can be constructed over the alphabet over the alphabet $\sum = \{a, b\}$ that accept universal language? $4$ $16$ $20$ $24$
asked
May 22, 2019
in
Theory of Computation
by
Hirak
Active

337
views
acetestseries
theoryofcomputation
finiteautomata
numberofdfa
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 Overflow Test Series  GATE CSE 2021
IIT gandhinagar mtech cse2020
IIT Delhi Research Interview Shortlists out
IIT Gandhinagar interview experience
IIT Gandhinagar Interview 2020
Subjects
All categories
General Aptitude
1.9k
Engineering Mathematics
8.2k
Digital Logic
2.9k
Programming and DS
5k
Algorithms
4.4k
Theory of Computation
6.2k
Compiler Design
2.2k
Operating System
4.6k
Databases
4.2k
CO and Architecture
3.4k
Computer Networks
4.2k
Non GATE
1.2k
Others
1.5k
Admissions
595
Exam Queries
562
Tier 1 Placement Questions
23
Job Queries
71
Projects
19
Unknown Category
1k
Recent Blog Comments
Exam results page should be loading faster now....
@Satyaki Guha You can give test anytime after...
1. Thank you sir. 2. It's been fixed now, thank...
Will the test have to be taken on the scheduled...
It'll be online as per the given...
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
52,218
questions
59,895
answers
201,086
comments
118,134
users