## Dynamical Recognizers: Real-time Language Recognition by Analog Computers (1996)

### Cached

### Download Links

- [acoma.santafe.edu]
- [ftp.santafe.edu]
- [ftp.santafe.edu]
- DBLP

### Other Repositories/Bibliography

Venue: | Theoretical Computer Science |

Citations: | 56 - 4 self |

### BibTeX

@ARTICLE{Moore96dynamicalrecognizers:,

author = {Cristopher Moore},

title = {Dynamical Recognizers: Real-time Language Recognition by Analog Computers},

journal = {Theoretical Computer Science},

year = {1996},

volume = {201},

pages = {99--136}

}

### Years of Citing Articles

### OpenURL

### Abstract

We consider a model of analog computation which can recognize various languages in real time. We encode an input word as a point in R d by composing iterated maps, and then apply inequalities to the resulting point to test for membership in the language. Each class of maps and inequalities, such as quadratic functions with rational coefficients, is capable of recognizing a particular class of languages; for instance, linear and quadratic maps can have both stack-like and queue-like memories. We use methods equivalent to the VapnikChervonenkis dimension to separate some of our classes from each other, e.g. linear maps are less powerful than quadratic or piecewise-linear ones, polynomials are less powerful than elementary (trigonometric and exponential) maps, and deterministic polynomials of each degree are less powerful than their non-deterministic counterparts. Comparing these dynamical classes with various discrete language classes helps illuminate how iterated maps can...