The following pages link to (Q3396632):
Displayed 24 items.
- Tree-automatic scattered linear orders (Q264574) (← links)
- Automatic models of first order theories (Q387121) (← links)
- On automaton presentations of projective planes (Q467658) (← links)
- Algebraic structures computable without delay (Q528478) (← links)
- Automatic learning of subclasses of pattern languages (Q690501) (← links)
- Dynamic algorithms for multimachine interval scheduling through analysis of idle intervals (Q727980) (← links)
- Learnability of automatic classes (Q1757849) (← links)
- Eliminating unbounded search in computable algebra (Q2011637) (← links)
- Punctual definability on structures (Q2033006) (← links)
- Non-density in punctual computability (Q2041959) (← links)
- Effective categoricity of automatic equivalence and nested equivalence structures (Q2195573) (← links)
- Online presentations of finitely generated structures (Q2205949) (← links)
- The isomorphism problem for tree-automatic ordinals with addition (Q2274485) (← links)
- On decidability of list structures (Q2332060) (← links)
- Uncountable automatic classes and learning (Q2431428) (← links)
- Isomorphisms of scattered automatic linear orders (Q2446106) (← links)
- Cayley Automatic Groups and Numerical Characteristics of Turing Transducers (Q2817373) (← links)
- Decision Problems for Finite Automata over Infinite Algebraic Structures (Q2830202) (← links)
- The isomorphism problem on classes of automatic structures with transitive relations (Q2847190) (← links)
- AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES (Q5207571) (← links)
- A hierarchy of tree-automatic structures (Q5388735) (← links)
- PUNCTUAL CATEGORICITY AND UNIVERSALITY (Q5858918) (← links)
- Learners based on transducers (Q5918614) (← links)
- Automatic presentations of structures (Q6064290) (← links)