Define NFA. With example explain the extended transition functione

please make sure the answer is correct and the diagram is understandable. please explain how to get the NAND-AND structure from the AND-OR-NOT. Thanks in advance for your help

Follow the given steps to convert an NFA to its equivalent DFA:  Suppose we are given the following NFA over the alphabet {a, b}: Compute the lambda-closure for each of the following states:                  λ(0) =                  λ(1) =                  λ(2) =                  λ(3) =

Can you use car and cdr only like: (car(cdr)) and such for the solution?

Determine whether each of the following functions f : {a,b,c,d} -> {a,b,c,d} is one-to-one and/or onto.  (a) f(a) = b, f(b) = a, f(c) = b, f(d) = c (b)  f(a) = b, f(b) = b, f(c) = d, f(d) = c (c)  f(a) = b, f(b) = a, f(c) = c, f(d) = d (d)  f(a) = d, f(b) = a, f(c) = c, f(d) = b (e)  f(a) = c, f(b) = d, f(c) = a

Discrete Structure