# 正则语言代写｜Coursework 1 – Regular Languages & Finite State Automata

## Q1 Finite State Automata

The following questions concern both deterministic and non-deterministic
finite state automata.

### Q1.1 Finite state machine basics

From the following statements select all that are true.

• The alphabet of a finite state machine is finite.
• A finite state machine must have an accepting state.
• A finite state machine may have more than one start state.
• The empty sting (ϵ) is accepted by every finite state machine.
• A finite state machine may either , or a accept reject decline string.
• A finite state machine accepts a string when the machine transitions
to an accepting state.
• A finite state machine will terminate on every input.

### Q1.2 Finite state machine diagrams

Consider the following finite state automata with alphabet {1, 0} From the following statements select all that are true.

• q0 is the start state.
• The language of the machine is empty.
• The machine is non-deterministic.
• The machine accepts the empty string (ϵ).
• The machine will accepts all strings over {0, 1}∗ of length 1.
• The alphabet of the machine is {0, 1, ϵ}.
• The machine accepts all strings of even length.
• q4 is a “dead” state. E-mail: itcsdx@outlook.com  微信:itcsdx 