Define next state function in terms of description and as a state transition diagram or a mathematical function or pseudo code, define time scale for your model.
Pattern Recognizer (using a state transition diagram)
A Pattern Recognizer that accepts single digit inputs (0 or a 1) each time unit and outputs a NO (as a 0) until the pattern 101101 has been in the stream of inputs then a YES (as a 1) will be output.
A register that hold the last several digits received and shifts in a new digit when received and shifts out the oldest digit.
Answer:
Z = (SZ, IZ, OZ, NZ, RZ)
SZ = {None, 1, 10, 101, 1011, 10110, 101101}
IZ = {1, 0}
OZ = {YES, NO}
NZ = {((None, 0), None), ((None, 1), 1), ((1, 1), 1), ((1, 0), 10), ((10, 1), 101), ((10, 0), None), ((101, 1), 1011), ((101, 0), 10), ((1011, 1), 1), ((1011, 0), 10110), ((10110, 1), 101101), ((10110, 0), None), ((101101, 0), None), ((101101, 1), None)}
RZ = {(x, q): x ∈ SZ; q ∈ OZ; if x = ( 1, 0, 1, 1, 0,
q = YES, q = NO}
Question: ?
Run two system experiments to demonstrate that your pattern recognizer works.
Use the following input trajectories:
f1={(0,1),(1,1),(2,0),(3,1),(4,1),(5,0),(6,1),(7,0),(8,1),(9,1),(10,0),(11,1),(12,1),(13,0), (14,0), (15,0),(16,1)}
f2={(0,0),(1,1),(2,1),(3,1),(4,0),(5,0),(6,1),(7,1),(8,0),(9,0),(10,1),(11,1),(12,0),(13,0), (14,0), (15,1),(16,1)}
Start your system in the state (initial) that represents “None”, or the (0,0,0,0,0,0,0) state, of the digits of the pattern have been observed and run your experiments for 16 time steps
Expert Answer