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

I forgot my password
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Blogs
Previous Year
Exams
Recent questions tagged automata
0
votes
0
answers
Deterministic Finite Automata
I need help in understanding the reasoning behind finding total number of states when positions of particular input is fixed from left hand side or right hand side. The Gate Overflow website shows the formula that for: nth position from the left side ... of states is 2n I want to understand the logic behind this generalized formula. How did we come to this conclusion?
asked
Aug 1, 2020
in
Theory of Computation
by
aryashah2k
(
2
points)

37
views
finiteautomata
theoryofcomputation
automata
dfadesign
0
votes
0
answers
Finite Languages and Automata Theory
Design a DFA (Deterministic Finite Automata) over the inputs {a,b} for Even number of a's and w mod 3 = 2. Basically it means we need ot create dfa such that the strings have even number of a's and at the same time, length of the string divide ... of 2. I know how to do for even number of a's but how to implement the condition of w mod 3 =2? Help needed
asked
Jul 24, 2020
in
Theory of Computation
by
aryashah2k
(
2
points)

36
views
theoryofcomputation
finiteautomata
dfadesign
automata
+1
vote
0
answers
Self Doubt: AUTOMATA DCFL
$wxw^rw,x\epsilon(0,1)^*$ $,x=5$ Is this $DCFL$ or $not?$
asked
Feb 6, 2020
in
Theory of Computation
by
Debapaul
(
537
points)

52
views
automata
0
votes
0
answers
GATE FORUM: AMBIGUITY
asked
Jan 31, 2020
in
Theory of Computation
by
Debapaul
(
537
points)

144
views
automata
compilerdesign
0
votes
0
answers
Self Doubts #Decidablity
I am looking the explanation of the below mentioned being decidable / Undecidable. (Given : Defination of TM in binary) Turing machine's control head move left/ right once, for a given input . Turing machine's control head move left/ right any ... answer vary from 2nd point ?) Turing machine replaces at least one character / exactly k (finite) characters in the input.
asked
Jan 20, 2020
in
Theory of Computation
by
dr_Jackal
(
5
points)

17
views
decidability
automata
turingmachine
0
votes
2
answers
GATE FORUM: AUTOMATA
Ans given is $C$ , but how can it be so? there are some languages which are accepted by $\epsilon  NFA$ which will not be recognized by a normal NFA untill and unless it is converted, so how is $S1$ correct? And there are some regular languages ... S1: A language is regular if there exists an NFA that accepts it S2: A language is regular if there exists a DFA that accepts it
asked
Jan 7, 2020
in
Theory of Computation
by
Debapaul
(
537
points)

59
views
automata
0
votes
0
answers
GATE GURU TEST SERIES AUTOMATA
Let $A$ be a $regular$ $language$ and $B$ be a $CFL$ over the alphabet $\sum^*$, which of the following about the langauge $R=\overline{A}B$ is $TRUE?$ R is necessarily $CFL$ but $not$ necessarily $regular$ R is necessarily $regular$ but $infinite$ $R$ is ... then $\overline{A}B=a^xb^y$, where $x\neq y$, so it is a $CFL$ right? So option $a$ should be correct right?
asked
Jan 6, 2020
in
Theory of Computation
by
Debapaul
(
537
points)

79
views
automata
0
votes
0
answers
Made Easy: FLT 222
Let $A = (a^*b^*)$ and $B = {(bb, ba, bbb)}$. Then $A/B$ represents of the following language when $/$ is $quotient$ $operation.$ $\phi$ ${b^*}$ ${a^*b^*}$ $none$ What does $quotient$ $operation$ means in case of automata? And how to solve this question?
asked
Jan 1, 2020
in
Theory of Computation
by
Debapaul
(
537
points)

19
views
automata
0
votes
0
answers
SELF DOUBT: AUTOMATA
Is $(Regular$ $language) CFL$ always $regular$?
asked
Dec 12, 2019
in
Compiler Design
by
Debapaul
(
537
points)

29
views
automata
0
votes
0
answers
TOCACE Test
Let L={TML(TM)$=\Phi$} Then complement of $L$ is $(A)$ {TM TM accepts $\epsilon$} $(B)$ {TM TM accepts some string} $(C)$ {TM TM accepts a perticular string $\omega$} $D$ all of the above complement of $\phi$ should be all, isnot it?
asked
Nov 17, 2019
in
Theory of Computation
by
srestha
(
1k
points)

29
views
toclanguages
automata
0
votes
0
answers
TOCACE Test Series
Which of the following statement is True? $(A)$ Every subset of regular is regular language. $(B)$ Every subset of recursive is recursive language. $(C)$ Every subset of recursive enumerable is recursive enumerable language. $(D)$ None What happen operation on ... langulage? I know A) is false, but donot know about other. If anyone know about other languages too, plz let me know
asked
Nov 17, 2019
in
Theory of Computation
by
srestha
(
1k
points)

72
views
toclanguages
automata
0
votes
0
answers
TOC: ACE Test
Which of the following is noninherently unambiguous language? $\left ( A \right ) L=wxw^{r}w.x\in \left ( 0+1 \right )^{*}$ $\left ( B \right ) L=wxw^{r}w\in \left ( 0+1 \right )^{*}$ $\left ( C \right ) L=ww^{r}w\in \left ( 0+1 \right )^{*}$ $(D)$ None of above
asked
Nov 15, 2019
in
Calculus
by
srestha
(
1k
points)

25
views
automata
toclanguages
0
votes
0
answers
From the "Suggested Exercises" section(at the end of the book) of "Principles of Compiler Design" By Aho and Ullman.
asked
Sep 12, 2019
in
Theory of Computation
by
Sukhbir Singh
(
3
points)

35
views
automata
finiteautomata
0
votes
2
answers
Doubts regarding Reducibility
Hi All, I am facing a doubt regarding the concept of reducibility. I read that if A is reducible to B, it means A cannot be harder than B. Suppose B is CSL, what can I say about A then? Thanks.
asked
Jun 28, 2019
in
Theory of Computation
by
DukeThunders
(
215
points)

32
views
theoryofcomputation
automata
0
votes
0
answers
#TOC_TESTSERIES
Consider the language L where the symbol $\leqslant$p refers to polynomial time reducible. Which of the following is true regarding the above language? L is undecidable L is decidable L is regular None of these.
asked
Jun 23, 2019
in
Theory of Computation
by
Sumiran Agrawal
(
25
points)

34
views
automata
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.
Recent Posts
New GATEOverflow PDFs
Guidelines to users
No Recent Blog Comments
8,998
questions
3,130
answers
14,378
comments
95,816
users