AutStr: computing with infinite structures
==========================================

AutStr represents infinite mathematical structures as finite automata and lets
you query them with first-order and monadic second-order logic. Start with the
**Overview** for a guided tour; the showcase notebooks — executed freshly on
every documentation build — work through each area in depth, and the API
reference is generated from the docstrings.

.. toctree::
   :maxdepth: 2
   :caption: Guide

   overview

.. toctree::
   :maxdepth: 1
   :caption: Notebooks

   notebooks/arithmetic_and_algebra
   notebooks/graphs
   notebooks/groups
   notebooks/composition
   notebooks/implicit_evaluation

.. toctree::
   :maxdepth: 2
   :caption: API reference

   api/modules

Indices and tables
==================

* :ref:`genindex`
* :ref:`modindex`
* :ref:`search`