True or false?   lambda transitions are exactly the same as other non determinism

Required information Let C(x) be the statement " x has a cat," let D(x) be the statement " x has a dog," and let F(x) be the statement " x has a ferret" Let the domain consist of all students in your class. Express the statement below in terms of C(x),D(x).F(x), quantifiers, and logical connectives. A student in your class has a cat, a dog, and a ferret. Multiple Choice ∀x(C(x)∨D(x)∨P(x)) ∃x(x)∨D(x)∨P(x)) ∀x(C(x)∧D(x)∧P(x)) ∃x(C(x)∧D(x)∧R(x)

Give a regular expression for the following language of kiswahili verbs: Kiswahili verbs = {imba, ninaimba, anaimba, unaimba, tunaimba, wanaimba, mnaimba, wanaimbia, tunaimbisha, cheza, ninacheza, anacheza, unacheza, tunacheza, wanacheza, mnacheza, mnachezea, unachezesha) in Automata Theory and Languages.

For the following pairs of expressions, find a unifier for each pair if a unifier exists. If a unifierdoes not exist, explain why.(a) p(X,Y) and p(a,Z)(b) p(X,X) and p(a,b)(c) f(X,Y) and f(a,g(a))(d) q(X) and ¬q(a)