228 views
0 votes
0 votes
Consider the Language l = {epsilon, a, b, cd , efg}

which of the following automaton will accept this language?

i)   Finite Automaton

ii)  Finite Automaton with only one stack(acceptance by empty stack)

iii) DPDA with 1 more stack.

a) i, ii, iii

b) i, ii

c) i, iii

d) only iii

1 Answer

Related questions

0 votes
0 votes
2 answers
1
1 votes
1 votes
2 answers
2
Akriti sood asked Dec 18, 2016
925 views
Given a push down automaton M with one state, whether L (M) = ∑* is Decidable Undecidable Semi – decidable Would have been decidable if halting problem was decida...
2 votes
2 votes
3 answers
3