Which of the following can be computed by a deterministic finite

state automaton? (Select all that are computable)?

Question

Which of the following can be computed by a deterministic finite  
 
state automaton? (Select all that are computable)?

Accepted Answer

Strings which have no single  a s (i.e. any  a  is either preceded or followed by another  a ).

Answer

Strings that start and end with the same character.

Answer

Strings which have more  a s than  b s.

Answer

Strings that start with a certain number of  a s end with the same number of  a s.

Crowdly