From 2007.igem.org

Revision as of 08:58, 18 October 2007 (view source) Errandir (Talk | contribs) (→'''.:: System Explanation ::.''') ← Older edit		Revision as of 09:03, 18 October 2007 (view source) Errandir (Talk | contribs) (→'''.:: System Explanation ::.''') Newer edit →
Line 31:		Line 31:
	The resulting automaton is represented by Fig. 1.		The resulting automaton is represented by Fig. 1.
-	[[Image:FSM.png|50x25pxl]]	+	[[Image:FSM.png|thumb|450px|Figure 1: Graph representing the finite state machine.]]

---

Revision as of 09:03, 18 October 2007

.:: System Explanation ::.

The proposed system is best described by a Mealy machine Mealy machine, a special type of finite state machines (FSM). Mealy machines are described by a 6-tuple, (Q, q₀, Σ, Λ, δ, Ω), with:

• Q - a set of states, for the proposed system we use three different states (q₀ - not yet trained, q₁ - trained to recognize chemical A, q₂ - trained to recognize chemical B)
• q₀ - a start state, here we assume we start in a state where the system is not yet trained
• Σ = {AL, A, BL, B} - an input alphabet
• Λ = {green, red, cyan, yellow, nothing} - an output alphabet
• δ : Q × Σ → Q - a state transition function
• Ω : Q × Σ → Λ - an output function

In detail, the transition function δ and the output function Ω look as follows:

inputs/states	q0	q1	q2		inputs/states	q0	q1	q2
AL	q1	q1	q1		AL	nothing
A	q0	q1	q2		A		red	cyan
BL	q2	q2	q2		BL	nothing
B	q0	q1	q2		B		green	yellow

The resulting automaton is represented by Fig. 1.