Minimal elements for the base b representations of the prime numbers > b for the subsequence ordering, for 2 ≤ b ≤ 36

Artificial Intelligence Lab(Prolog, Python), Computer Networks Lab (Cisco Packet Tracer), Distributed Database Systems Lab (PL-SQL), Formal Language and Compilers Lab (C++, Java)

NFA (nondeterministic finite automaton) simulator using C++

Practical work on the subject: "Theory of formal languages"

Minimal type-safe PHP compiler

C++ Parsers

Projects for the Formal Languages and Automata class in C++.

CSE 4130 : Formal Languages and Compilers

A simple console application for converting a left linear grammar into a right linear one

🖧 Program that loads a DFA/NFA from a file, then checks if words are accepted by the automata.

Laboratories from Formal Languages and Compilers course at the university.

Kompilator prostego języka imperatywnego; Flex, Bison, C++

Simple Interpreter using Formal Languages and Automata

🎞 ⚙️ 🎛 | Theory of Machines and Languages Course CEIT@AUT

A repo containing some projects regarding Finite Languages and Automata

State finite machines examples, thrax gramma and simple regex tasks. Created at the University as the project within Automata Theory and Formal Languages classes in 2014. The purpose of those examples was to learn automata and formal languages theory and also create simple state finite machines.

Formal languages homework