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 …
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 …
A general-purpose AI learning platform with structured long-term goal planning, dynamic learning paths, and adaptive spaced repetition.
Manipulate Infinite Data Structures in Python