Regular Invariant Generator and SMTLIB2 code transformer

A statically typed embedding of miniKanren in Haskell

A regular expression to SMT-LIB constraint translator

experiments around algorithm for computing finite semigroups

ANTLR (ANother Tool for Language Recognition) is a powerful parser generator for reading, processing, executing, or translating structured text or binary files.

BisPy - Python bisimulation library

μJS Finite-state Automata String Analyzer

A Dynamic Symbolic Execution (DSE) engine for JavaScript. ExpoSE is highly scalable, compatible with recent JavaScript standards, and supports symbolic modelling of strings and regular expressions.

Computer graphics algorithms course paper, BMSTU

Actor-based state management & orchestration for complex app logic.

💎 A fast, open source text processor and publishing toolchain, written in Ruby, for converting AsciiDoc content to HTML 5, DocBook 5, and other formats.

Algorithms for efficient pattern matching

Бауманский курс по теории формальных языков

Lab works on the course "Formal languages theory", BMSTU, V term

Лабораторные работы по курсу "Теория Формальных Языков"

Лабораторные по курсу "Теория формальных языков"

The LaTeX beamerposter package

static analysis of C/C++ code

Recent Fuzzing Paper

A Quick Research of Active Automata Learning

Grammar synthesis algorithm using a black box oracle

Resources for learning Category Theory for an enthusiast

C++ library for semigroups and monoids