Consider the language L over the alphabet {0, 1}, given below:

$$L = \{ w \in {\{ 0,1\} ^ * }|w$$ does not contain three or more consecutive $$1's\} $$.

The minimum number of states in a Deterministic Finite-State Automaton (DFA) for L is ___________.

We reached the station late, and ___________ missed the train.

Kind : ___________ : : Often : Frequently

(By word meaning)

A series of natural numbers $$F_1,F_2,F_3,F_4,F_5,F_6,F_7,\,.....$$ obeys $$F_{n+1}=F_n+F_{n-1}$$ for all integers $$n\ge2$$.

If $$F_6=37$$, and $$F_7=60$$, then what is $$F_1$$ ?