What is the minimum number of gates required to implement the Boolean function $$(AB+C)$$ if we have to use only $$2$$-input NOR gates?

$${\left( {1217} \right)_8}$$ is equivalent to

Given the following state table of an $$FSM$$ with two states $$A$$ and $$B,$$ one input and one output:

If the initial state is $$A = 0, B=0.$$ What is the minimum length of an input string which will take the machine to the state $$A=0, B=1$$ with Output$$=1?$$

The binary operation ◻ is defined as follows:

Which one of the following is equivalence to $$P \vee Q$$?