Theory of Computation - Old Questions
11. Define the non-deterministic finite automata (NFA) and write down recursive definition of for NFA.
8 marks
|
Asked in 2069