• English only

# Differences

This shows you the differences between two versions of the page.

finite_state_machine [2009/04/28 20:05]
vkuncak
finite_state_machine [2009/04/28 20:05] (current)
vkuncak
Line 44: Line 44:
**Example:​** the example automaton above accepts the language $L = \{a, bara, barbara, barbarbara, \ldots \}$, which we can denote by $\{ (bar)^n a \mid n \geq 0 \}$. **Example:​** the example automaton above accepts the language $L = \{a, bara, barbara, barbarbara, \ldots \}$, which we can denote by $\{ (bar)^n a \mid n \geq 0 \}$.

-What is the automaton accepting strings of the form $p barbara q$ where $p,q$ are arbitrary strings?+What is the automaton accepting strings of the form $pbarbaraq$ where $p,q$ are arbitrary strings?

A state machine is called **deterministic** iff for every pair $(q_1,a) \in Q \times \Sigma$ there exists exactly one $q_2 \in Q$ such that $(q_1,​a,​q_2) \in \Delta$. A state machine is called **deterministic** iff for every pair $(q_1,a) \in Q \times \Sigma$ there exists exactly one $q_2 \in Q$ such that $(q_1,​a,​q_2) \in \Delta$.