Skip to main content
Ctrl+K

AutStr 4.0.0

  • AutStr: computing with infinite structures

Guide

  • Overview

Notebooks

  • Arithmetic and algebra over infinite structures
  • Infinite graphs, and how far first-order logic reaches
  • Graphs of bounded width as uniformly automatic classes
  • Groups as uniformly automatic classes
  • Building new structures from old
  • Implicit evaluation: querying members whose automata are too big to build

API reference

  • autstr
    • autstr package
      • autstr.symbolic package
      • autstr.utils package

Project

  • Changelog
  • References
  • Repository
  • Open issue

Python Module Index

a
 
a
- autstr
    autstr.algebra
    autstr.arithmetic
    autstr.chain_ring
    autstr.cocycle_groups
    autstr.collapsible
    autstr.collapsible_reach
    autstr.composition
    autstr.graphs
    autstr.groups
    autstr.implicit
    autstr.infinite_graphs
    autstr.interpretations
    autstr.mtbdd
    autstr.ordinals
    autstr.powerset
    autstr.presentations
    autstr.sparse_automata
    autstr.sparse_tree_automata
    autstr.symbolic
    autstr.symbolic.backends
    autstr.symbolic.compiler
    autstr.symbolic.context
    autstr.symbolic.expr
    autstr.symbolic.signature
    autstr.tree_algebra
    autstr.tree_arithmetic
    autstr.tree_graphs
    autstr.tree_groups
    autstr.tree_presentations
    autstr.tree_uniform
    autstr.turing
    autstr.uniform
    autstr.utils
    autstr.utils.automata_tools
    autstr.utils.logic
    autstr.utils.misc
    autstr.utils.tree_automata_tools

By Faried Abu Zaid

© Copyright 2022-2026, Faried Abu Zaid.