We study a scenario in which a machine acts upon input from its environment by changing the environment, hence affecting its own future input. The machine is a string pattern matcher; the environment varies - for example it can be a one-character buffer. Practical experiments reveal a disparity between stable and unstable (or irregular) behaviour of the machine, depending on the initial state. We suggest a definition of stability and study its theoretical properties. © 1995.
Johansen, P. (1995). On-line string matching with feedback. Theoretical Computer Science, 141(1–2), 53–67. https://doi.org/10.1016/0304-3975(94)00184-7