# Automata

**Repository Path**: mirrors_davisjam/Automata

## Basic Information

- **Project Name**: Automata
- **Description**: Automata and transducer library for .NET
- **Primary Language**: Unknown
- **License**: MIT
- **Default Branch**: master
- **Homepage**: None
- **GVP Project**: No

## Statistics

- **Stars**: 0
- **Forks**: 0
- **Created**: 2020-08-08
- **Last Updated**: 2026-05-16

## Categories & Tags

**Categories**: Uncategorized

**Tags**: None

## README

# Automata
Automata is a .NET library that provides algorithms for composing and analyzing _regular expressions_, _automata_, and _transducers_. In addition to classical word automata, it also includes algorithms for analysis of _tree automata_ and _tree transducers_. The library covers algorithms over finite alphabets as well as their _symbolic_ counterparts. In symbolic automata concrete characters have been replaced by _character predicates_. Such predicates can range over very large or even _infinite_ alphabets, like integers. Predicates can be supported by an SMT solver as a plugin.