Which of the following is a PDA? (i) Finite automaton with a stack (ii — PYQDeck

PyQdeckBEU PYQ Archive Subjects

Back to the 2024 paper

Module 2: Context-Free Languages (CFL) and PDA

20242m

Which of the following is a PDA?

(i) Finite automaton with a stack
(ii) Turing machine with a stack
(iii) Finite automaton with a queue
(iv) Turing machine with a queue

Search Google Ask AI

Similar questions

Compiler DesignWhich automaton accepts regular languages? (i) PDA (ii) DFA (iii) Turing machine (iv) LBA20252m FORMAL LANGUAGE & AUTOMATA THEORYA Turing Machine has: (i) A finite tape (ii) An infinite tape (iii) A stack (iv) A queue20242m Formal Language & Automata TheoryA pushdown automata can be represented as \text{PDA} = \epsilon\text{-NFA} + [\text{stack}]. (i) True (ii) False20202m Formal Language & Automata TheoryWrite short notes on the following: (i) Deterministic PDA vs. non-deterministic PDA (ii) Universal Turing machine (iii) Non-deterministic Turing machine (iv) Post correspondence problem (PCP)20197m

PreviousWhich of these represents a regular language? (i) \{ a^n b^n \mid n \ge 0 \} (ii) Strings with equal number of a’s and b’s (iii) \{ a^n \mid n \text{ is prime} \} (iv) \{ w \mid w \text{ starts with 'a' and ends with 'b'} \}NextWhat is Automata? Explain classification of Automata.