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

Various Automata implementations in C

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.

fsmconv is a command-line tool for converting FSA from one to another representation.

This Program is the implementation of NFA for accepting states in c

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

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

C library for SLR parsing

This repository contains all of my codes of Compiler Lab

A simple interpreted language for building Turing machines and other automata

18CSC304J - Compiler Design course

REL is a non-backtracking regular expression engine with support for constant lookahead and submatch tracking.

Monorepo containing the spot text editor and an implementation of the m4 macro processor

Topologic Python Library. A library to simulate DFAs and Probabilistic DFAs using context switching. This library provides a way to build and define the behavior of a graph. The client is able to define the function each vertex and edge of the graph make and how the graph transitions from one (the first valid edge) or to many states, as well as …

Russ Cox/Rob Pike pikevm regex implementation