Back to the 2020 paper
Similar questions
FORMAL LANGUAGE & AUTOMATA THEORYA language accepted by deterministic pushdown automata is closed under which of the following? (i) Complement (ii) Union (iii) Both (i) and (ii) (iv) None of the above20232mFormal Language & Automata TheoryDefine deterministic pushdown automata. Explain with an example.20227mFormal Language & Automata TheoryWrite a short note on: Pushdown Automata20257mFormal Language & Automata TheoryA pushdown automata can be represented as \text{PDA} = \epsilon\text{-NFA} + [\text{stack}]. (i) True (ii) False20202m
PreviousA pushdown automata can be represented as \text{PDA} = \epsilon\text{-NFA} + [\text{stack}]. (i) True (ii) FalseNextA _____ is context free grammar with atmost one non-terminal in the right handside of the production. (i) linear grammar (ii) linear bounded grammar (iii) regular grammar (iv) None of the above