A language L or which there exists a TM, T, that accepts every word in L and either rejects or loops for every word that is not in L, is said to be:

The machine pictured in Figure:

The FSM pictured in Figure recognises:

A finite state machine with the following state table has a single input x and a single output z.

If the initial state is unknown, then the shortest input sequence to reach the final state C is: