## Finite Presentations of Infinite Structures: Automata and Interpretations (2002)

### Cached

### Download Links

- [www-mgi.informatik.rwth-aachen.de]
- [www-mgi.informatik.rwth-aachen.de]
- [www.logic.rwth-aachen.de]
- [www.mathematik.tu-darmstadt.de]
- DBLP

### Other Repositories/Bibliography

by
Achim Blumensath
,
Erich Grädel

Venue: | Theory of Computing Systems |

Citations: | 42 - 3 self |

### BibTeX

@ARTICLE{Blumensath02finitepresentations,

author = {Achim Blumensath and Erich Grädel},

title = {Finite Presentations of Infinite Structures: Automata and Interpretations},

journal = {Theory of Computing Systems},

year = {2002},

volume = {37},

pages = {2004}

}

### Years of Citing Articles

### OpenURL

### Abstract

We study definability problems and algorithmic issues for infinite structures that are finitely presented. After a brief overview over different classes of finitely presentable structures, we focus on structures presented by automata or by model-theoretic interpretations.