The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
22 views
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
asked ago in Theory of Computation by Junior (873 points) | 22 views

1 Answer

+2 votes
Since it is finite so it is regular language so it is accepted by all 1..2.and 3
answered ago by Active (1.5k points)

Related questions

0 votes
2 answers
1
+1 vote
2 answers
2


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

38,009 questions
45,506 answers
131,660 comments
48,692 users