Team:Sweden/Project
From 2009.igem.org
(→Project) |
|||
Line 58: | Line 58: | ||
|bordercolor="gold" bgcolor="gold"| | |bordercolor="gold" bgcolor="gold"| | ||
- | [[Image:teamsweden_state.png|580px|right]] | + | [[Image:teamsweden_state.png|580px|right|The above image represents an automaton that show how state transition occurs in a particular sentence parsing automaton ]] |
Revision as of 12:18, 18 October 2009
Home | Team | Project | Mathematical Modelling | Logbook | Result | Parts | Sponsors |
---|
Project
We want to implement an automaton in the cell. It is based on a few simple rules on how to parse a simple sentence like
We target only the parts of speech (POS) tags which in these above grammars are:
This way the grammar can be implemented as a finite state automaton (FSA) and not as a push-down automaton. A finite state automation is a 5-tupel A = (Q, Σ, δ, s0, F), where Q is a finite set of states, Σ is the finite set of input symbols (alphabet), δ is the transition function, δ: Q × Σ -> Q, s0 is the start state and F is the set of final/accepting states. Our AimThe sentence in our project is a string of different reagents which will be introduced to the cell one by one. As soon as a wrong input is detected the cell will light up red. A sentence is finished by a stop reagent and then the cell will light up green.
|