Epsilon (\varepsilon) transitions are allowed in (i) DFA only (ii) Bot

Back to the 2025 paper

Module 1: Introduction, Regular languages and finite automata

20252m

Epsilon ( $\varepsilon$ ) transitions are allowed in

(i) DFA only
(ii) Both DFA and NFA
(iii) NFA only
(iv) None

Similar questions

FORMAL LANGUAGE & AUTOMATA THEORYA DFA can have: (i) Multiple start states (ii) Multiple accepting states (iii) Transitions on \varepsilon (iv) None of the above20242m FORMAL LANGUAGE & AUTOMATA THEORYDefine NFA with \varepsilon-transitions with an example.20247m Formal Language & Automata TheoryThe maximum number of states of a DFA converted from an NFA with n states is (i) n (ii) n^2 (iii) 2^n (iv) None of the above20212m FORMAL LANGUAGE & AUTOMATA THEORYThe maximum number of states of a DFA converted from an NFA with n states is: (i) n (ii) n^2 (iii) 2^n (iv) None of the above20212m

PreviousWhich grammar type is the most powerful? (i) Type-0 (ii) Type-1 (iii) Type-2 (iv) Type-3 NextContext-Free Grammars are equivalent to (i) Finite Automata (ii) Turing Machines (iii) Linear Bounded Automata (iv) Pushdown Automata

Official AppAndroid App

PYQDeck for Android

Solve BEU previous-year exam papers anywhere, anytime. Fast search, offline paper viewing, and step-by-step solutions designed specifically for your phone.

Get on Google Play