Synchronized rational relations of finite and infinite words
Theoretical Computer Science - Selected papers of the International Colloquium on Words, Languages and Combinatorics, Kyoto, Japan, August 1990
Word Processing in Groups
Automatic Presentations of Structures
LCC '94 Selected Papers from the International Workshop on Logical and Computational Complexity
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Automatic Sequences: Theory, Applications, Generalizations
Automatic Sequences: Theory, Applications, Generalizations
Automatic structures: overview and future directions
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
Automatic Structures: Richness and Limitations
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
On relations defined by generalized finite automata
IBM Journal of Research and Development
Theories of Automatic Structures and Their Complexity
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
Game quantification on automatic structures and hierarchical model checking games
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Where automatic structures benefit from weighted automata
Algebraic Foundations in Computer Science
| Hi-index | 0.00 |
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 regular relations by showing that order-invariant first-order logic can be stronger than first-order logic with counting on automatic structures. We introduce a notion of equivalence of automatic presentations, define semi-synchronous transductions, and show how these concepts correspond. Our main result is that a one-to-one function on words preserves regularity as well as non-regularity of all relations iff it is a semi-synchronous transduction. We also characterize automatic presentations of the complete structures of Blumensath and Grädel.