[ACL 2021] Self-Attention Networks Can Process Bounded Hierarchical Languages

A very general generator to create QBF instances in popular formats given the formal definition of a formula family.

A class for creating and implementing L-system grammars in python

Synthesis of a controller for system with linear dynamics using restricted LTL formula

A somewhat sophisticated regular expression parser utilizing a finite automata

Program for proving elementary algebraic (perspective - geometry) theorems using distributed computations

A toy programming language including jflex scanner, cup parser and semantic validation. Executably by console and by gui (a toy-IDE).

Formal Requirements Toolkit

An automated solver for Hofstadter’s formal system called MIU, from Gödel, Escher, Bach: an Eternal Golden Braid

ANTLR-based (normal) Polish notation to .NET Framework compiler, with reflection and embedded scripting.

This repository deals with custom vocabularies that can be used to further specify fields of tilt (Transparency Information Language and Toolkit).

Algorithms for formal language written with Python 3 with nltk

NFA (nondeterministic finite automaton) simulator using C++