Invariants of Automatic Presentations and Semi-synchronous Transductions
- 1 January 2006
- book chapter
- Published by Springer Nature
- p. 289-300
- https://doi.org/10.1007/11672142_23
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Finite Presentations of Infinite Structures: Automata and InterpretationsTheory of Computing Systems, 2004
- Automatic SequencesPublished by Cambridge University Press (CUP) ,2003
- Is Cantor’s Theorem Automatic?Published by Springer Nature ,2003
- Epsilon-logic is more expressive than first-order logic over finite structuresThe Journal of Symbolic Logic, 2000
- Undecidable extensions of Büchi arithmetic and Cobham-Semënov TheoremThe Journal of Symbolic Logic, 1997
- Automatic presentations of structuresPublished by Springer Nature ,1995
- Synchronized rational relations of finite and infinite wordsTheoretical Computer Science, 1993
- Definability hierarchies of generalized quantifiersAnnals of Pure and Applied Logic, 1989
- On direct products of automaton decidable theoriesTheoretical Computer Science, 1982
- Transductions and Context-Free LanguagesPublished by Springer Nature ,1979