user avatar
user avatar
user avatar
Ramesh
  • Member for 4 years, 10 months
  • Last seen more than a month ago
4 votes
2 answers
1k views

How can the intersection of CFLs and REGs be CFL if REG is a proper subset of CFL?

3 votes
1 answer
59 views

Refuting $H(L_1 \cap L_2) = H(L_1) \cap H(L_2)$ for homomorphisms

3 votes
2 answers
2k views

Why is "accepted by Turing Machine with even number of states" a trivial property?

2 votes
5 answers
6k views

Whether TM accepts epsilon?

2 votes
0 answers
282 views

concatenation of regular and DCFL

2 votes
1 answer
77 views

Intersection of languages using closure properties

1 vote
1 answer
393 views

Number of DFA states required

1 vote
1 answer
82 views

Not able to prove non regularity using pumping lemma

1 vote
0 answers
175 views

Doubt on dovetailing

1 vote
1 answer
283 views

Syntax directed translation part of which compiler phase?

1 vote
0 answers
54 views

Variable assignment in which compiler phase

1 vote
1 answer
108 views

R.E or non R.E?

1 vote
0 answers
267 views

Difficulty in reducing non halting problem to a given problem

1 vote
0 answers
270 views

Linear probing number of probe sequences

1 vote
0 answers
94 views

Set of infinite DFA's

0 votes
0 answers
143 views

Extended stars and bars approach using dynamic programming

0 votes
1 answer
2k views

Turing machine halting in at least 100 steps on all inputs

0 votes
0 answers
407 views

Regular language with number of a's same as number of b's

0 votes
0 answers
940 views

Complement of halting problem Co-RE or non R.E [duplicate]

0 votes
0 answers
34 views

Deadlock necessary conditions [duplicate]

0 votes
0 answers
53 views

Is the set of TMs whose language reduces to a fixed CFL also CFL?

0 votes
1 answer
937 views

What happens during the DFA reversal construction if the initial state is final?