This repository was created for the subject of Computer Theory. The propose of this subject is to improve your skills to solve the 0-1 knapsack problem of different ways. The techniques used were Dynamic Programing and two metaheuristics (which are GRASP and TABU search).

Repo que contiene practicas sobre Teoria de computacion que pueden ser mejorados o usarse para estudiar

Semester 5 course material for BS Computer Science at Fast National University Of Computer And Emerging Sciences

Given a set of numbers, there exists a sum from those set of numbers. This program then finds if there exists a subset in the given set of numbers where the sum of the subset is half the original sum calculated.

Consiste na implementação de um simulador de Autômato Finito Determinístico (AFD) que aceite a especificação de um AFD.

Italian notes for the course of "Computer Science Theory", LateX, A.A. 2020/2021 for MSc's in Computer Science.

NFA (nondeterministic finite automaton) simulator using C++

College "Computer Theory" exercises.