Programme Code : BCA
Course Code : cs-73
| More

Year : 2013 Views: 815 Submitted By : abhinav sharma On 15th March, 2013

Do you have solution for this Question. If yes    I aslo want solution.


Define the following concepts formally:

(a) Finite Automata

(b) Non-Deterministic Finite Automata (NDFA)

(c) Kleene Closure of a set of expressions

(d) Regular Expression

(e) Regular Language

(f) Primitive Recursive Function

(g) Unsolvable Problem

(h) Turing Machine

(i) Universal Turing Machine

(j) Turing-Decidable Problem

(k) Moore Automata

(l) Context-free Language

(m) Pushdown Automata

(n) Halting Problem

(o) NP-Hard Problem

(p) Context-free Language (8 marks)


No Answer Found