Formal languages homework

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.

A repo containing some projects regarding Finite Languages and Automata

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

Simple Interpreter using Formal Languages and Automata

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

Laboratories from Formal Languages and Compilers course at the university.

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

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

CSE 4130 : Formal Languages and Compilers

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

C++ Parsers

Minimal type-safe PHP compiler

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

NFA (nondeterministic finite automaton) simulator using C++

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

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