Various Automata implementations in C

Important programs for Automata Lab for C.S.E 4th Sem.

Lab Programs for Compiler Design.

This is a Definite Finite Automata simulation to take a string to search in file tree structure, starting from a root directory searches all the corresponding file formats to search the string.

In this repository, we used C programming implementation of a Discrete Finite Automata (DFA) that can be utilized to validate three different machines. For more detailed information, please refer to its report. It is worth noting that the third machine specifically focuses on email validation, determining whether an email address is valid or not

Useful tools for people interested in mathematics and computer science (with a focus on the latter)

A code in C Language that simulates and check the possibles strings of a DFA (Deterministic finite automaton).

Mini project in C that demonstrates DFA creation and usage

Implementing a compiler for a miniature programming language.

Trabajo práctico transversal / Teoría de la Computación 1

Compiler course work - Comments in C based on an DFA

First project of Theory of Computation course (IFCE) (2016.1)

This GitHub repository contains all the code implementations and practical exercises completed during my Theory of Computing course at IIT, University Of Dhaka . In this course, we explore the fascinating world of theoretical computer science, including the study of automata, formal languages, and computational complexity.

A programming language for simulating theoretical models of computation and programming language features

This repo contains all the solution to the problems given during the language processor lab of S7

Important C and C++ programs for computer engineers.

Program to construct a DFA which accept the language L = {a^nb^m | n mod 2=0, m≥1}

The goal of this project is to implement the basic tools allowing to build a lexical analyzer in C