Three major releases since 2.0 in a single summer — tree-automatic structures and MTBDD transitions in 3.0, bounded rank-width families and implicit evaluation in 3.1, and now …
AutStr is a Python library for symbolic representation and manipulation of infinite relational structures. It represents infinite mathematical objects — the integers ℤ, the …
A major rewrite of AutStr — a 10²–10³× faster automata core, uniformly automatic classes for whole families of finite structures, and MSO queries that compile into provably …
Study of uniformly automatic classes of finite structures.
A study of elementary complexity classes in the context of automatic structures.
Advice automatic structures and uniformly automatic classes in logic.
Model-theoretic properties of ω-automatic structures.