Analysing Complexity in Classes of Unary Automatic Structures
From MaRDI portal
Publication:3618610
DOI10.1007/978-3-642-00982-2_44zbMath1234.68226MaRDI QIDQ3618610
Publication date: 2 April 2009
Published in: Language and Automata Theory and Applications (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10292/2810
68Q25: Analysis of algorithms and problem complexity
68Q45: Formal languages and automata
03C13: Model theory of finite structures
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Elements of finite model theory.
- On direct products of automaton decidable theories
- Finite presentations of infinite structures: Automata and interpretations
- Three Lectures on Automatic Structures
- Model Theoretic Complexity of Automatic Structures (Extended Abstract)
- Unary Automatic Graphs: An Algorithmic Perspective
- Automata Presenting Structures: A Survey of the Finite String Case
- STACS 2004
- Automatic Structures: Richness and Limitations
- Database Theory - ICDT 2005