"
Team:Sweden/Project
From 2009.igem.org
(→Project) |
|||
| Line 1: | Line 1: | ||
| - | [[Image: | + | [[Image:Header_change.jpg|center|970px]] |
| - | {|style=" | + | {|style="background-color:#0000A0;" cellpadding="6" cellspacing="1" border="2" width="100%" align="center" |
| - | !align="center"|[[Team:Sweden|Home]] | + | !"align="center"|[[Team:Sweden|<font color="gold">Home</font>]] |
| - | !align="center"|[[Team:Sweden/Team| | + | !align="center"|[[Team:Sweden/Team|<font color="gold">Team</font>]] |
| - | !align="center"|[[Team:Sweden/Project| | + | !align="center"|[[Team:Sweden/Project|<font color="gold">Project</font>]] |
| - | !align="center"|[[Team:Sweden/Mathematical Modelling|Mathematical Modelling]] | + | !align="center"|[[Team:Sweden/Mathematical Modelling|<font color="gold">Mathematical Modelling</font>]] |
| - | !align="center"|[[Team:Sweden/Logbook|Logbook]] | + | !align="center"|[[Team:Sweden/Logbook|<font color="gold">Logbook</font>]] |
| - | !align="center"|[[Team:Sweden/Result|Result]] | + | !align="center"|[[Team:Sweden/Result|<font color="gold">Result</font>]] |
| - | !align="center"|[[Team:Sweden/Parts|Parts]] | + | !align="center"|[[Team:Sweden/Parts|<font color="gold">Parts</font>]] |
| - | !align="center"|[[Team:Sweden/Sponsors|Sponsors]] | + | !align="center"|[[Team:Sweden/Sponsors|<font color="gold">Sponsors</font>]] |
|} | |} | ||
Revision as of 10:05, 8 October 2009
| Home | Team | Project | Mathematical Modelling | Logbook | Result | Parts | Sponsors |
|---|
Project
|
We want to implement this automaton in the cell. It is based on a few simple rules on how to parse a simple sentence like The little girl plays ball or Boys stroke the little dog. These simple rules are :
We target only the parts of speech (POS) tags because this way the grammar can be implemented as a finite state automaton (FSA) and not as a push-down automaton. A finite state automaton 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 with .  The sentence 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.
|  |
