"
Team:Sweden/Project
From 2009.igem.org
| (2 intermediate revisions not shown) | |||
| Line 26: | Line 26: | ||
|} | |} | ||
| + | <div style="text-align:justify"> | ||
== <font color="blue">Project</font> == | == <font color="blue">Project</font> == | ||
| Line 44: | Line 45: | ||
<ul type="disc"> | <ul type="disc"> | ||
<li> NP:Noun Phrase VP: Verb Phrase | <li> NP:Noun Phrase VP: Verb Phrase | ||
| - | <li>(det: | + | <li>(det:Determiner) (adj:adjective) N: Noun |
<li>VP:Verb Phrase V:Verb NP:Noun Phrase | <li>VP:Verb Phrase V:Verb NP:Noun Phrase | ||
</ul> | </ul> | ||
| Line 66: | Line 67: | ||
|bordercolor="gold" bgcolor="gold"| | |bordercolor="gold" bgcolor="gold"| | ||
| - | [[Image:Igem_modified. | + | [[Image:Igem_modified.gif|180px|center| ]] |
Latest revision as of 11:43, 21 October 2009
| Home | Team | Project | Mathematical Modelling | Logbook | Result | Sponsors |
|---|
Project
|
We want to implement an automaton in the E-Coli cell. It is based on a few simple grammer 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. |
The image represents an automaton that show how state transition occurs in a particular sentence parsing automaton  |
Safety issues\ We suggest our plasmid using a current Biobrick in the bank and no new bio bricks are suggested or built. So no safety issue is raised so far. |
|
