Mata: A Finite Automata Library

Mata: Knihovna pro konečné automaty

software

Use of the result by another entity is possible without acquiring a license (the result is not licensed)

The licensor does not require a license fee for the result

Havlena Vojtěch, Ing., Ph.D. (DITS)
Holík Lukáš, doc. Mgr., Ph.D. (DITS)
Chocholatý David, Ing. (DITS)
Lengál Ondřej, Ing., Ph.D. (DITS)
Síč Juraj, Mgr. (DITS)
Fiedor Tomáš, Ing., Ph.D. (RG VERIFIT)
Hruška Martin, Ing., Ph.D. (Automata@FIT)

finite automata

Mata is a well-engineered automata library written in C++ that offers a  unique
combination of speed and simplicity. It is meant to serve in applications such as
string constraint solving and reasoning about regular expressions, and as
a reference implementation of automata algorithms. Besides basic algorithms for
(non)deterministic automata, it implements a fast simulation reduction and
antichain-based language inclusion checking. The simplicity allows
a straightforward access to the low-level structures, making it relatively easy
to extend and modify. Besides the C++ API, the library also implements a Python
binding.

https://github.com/VeriFIT/mata

Open source software under the MIT license https://raw.githubusercontent.com/vhavlena/ranker/master/LICENSE

Efficient Finite Automata for Automated Reasoning, MŠMT, ERC CZ, LL1908, start: 2020-01-01, end: 2024-12-31, running
Reliable, Secure, and Intelligent Computer Systems, BUT, Vnitřní projekty VUT, FIT-S-23-8151, start: 2023-03-01, end: 2026-02-28, running
Representing Boolean Functions by a Self-Adaptable Data Structure, GACR, Standardní projekty, GA23-07565S, start: 2023-01-01, end: 2025-12-31, running

Automated Analysis and Verification Research Group - VeriFIT (RG VERIFIT)

Department of Intelligent Systems (DITS)