Invariants of Automatic Presentations and Semi−Synchronous Transductions
Automatic structures are countable structures finitely presentable by a collection of automata. We study questions related to properties invariant with respect to the choice of an automatic presentation. We give a negative answer to a question of Rubin concerning definability of intrinsically regula...
| 1. Verfasser: | |
|---|---|
| Format: | Conference item |
| Veröffentlicht: |
Springer
2006
|