Question

The Tuples for NDFA is ___________

(a) ∑, Q, q0, F, δ

(b) Q, q0, F, δ

(c) Θ, Q, q0, F,δ

(d) F, Q, Δ, q0, δ

This question was addressed to me during an interview.

I need to ask this question from Non-Deterministic Finite Automata in section Finite Automata and Regular Expression of Compiler

Answer 1

Correct answer is (a) ∑, Q, q0, F, δ

The explanation: An NFA is represented formally by a 5-tuple, (Q, Σ, Δ, q0, F), of

a  set of states Q

a set of input symbols Σ

a transition function Δ : Q × Σ → P(Q).

an initial state q0 ∈ Q

a  final state F ⊆ Q.