The following pages link to STACS 2004 (Q5309721):
Displaying 25 items.
- Tree-automatic scattered linear orders (Q264574) (← links)
- Model-theoretic complexity of automatic structures (Q636281) (← links)
- Automatic learning of subclasses of pattern languages (Q690501) (← links)
- Ehrenfeucht-Fraïssé goes automatic for real addition (Q710741) (← links)
- Semiautomatic structures (Q1694004) (← links)
- Learnability of automatic classes (Q1757849) (← links)
- Definability and automorphisms in abstract logics (Q1762731) (← links)
- Finite presentations of infinite structures: Automata and interpretations (Q1764419) (← links)
- On decidability of list structures (Q2332060) (← links)
- Deciding the isomorphism problem in classes of unary automatic structures (Q2430013) (← links)
- Automatic learners with feedback queries (Q2637649) (← links)
- String compression in FA-presentable structures (Q2682935) (← links)
- The isomorphism problem on classes of automatic structures with transitive relations (Q2847190) (← links)
- Multi-dimensional sets recognizable in all abstract numeration systems (Q2911426) (← links)
- Injection Structures Specified by Finite State Transducers (Q2970970) (← links)
- Automatic Learners with Feedback Queries (Q3091438) (← links)
- Where Automatic Structures Benefit from Weighted Automata (Q3098042) (← links)
- Automatic structures of bounded degree revisited (Q3107359) (← links)
- A Hierarchy of Automatic<i>ω</i>-Words having a Decidable MSO Theory (Q3526410) (← links)
- Analysing Complexity in Classes of Unary Automatic Structures (Q3618610) (← links)
- Automatic Structures of Bounded Degree Revisited (Q3644760) (← links)
- EQUIVALENT AUTOMATIC STRUCTURES AND THEIR BOUNDARIES (Q4029568) (← links)
- (Q5079723) (← links)
- Advice Automatic Structures and Uniformly Automatic Classes (Q5111205) (← links)
- A hierarchy of tree-automatic structures (Q5388735) (← links)
