There are 5 repositories under automata-theory topic.
📚 📖 📚CSE GATE Resources for GATE and CSE Aspirants 😎 😁 . Show your ❤️ by ⭐️⭐️
A collection of curated resources for learning Computer Science subjects and skills, that I garnered throughout my tenure as a CSE student. Contributions, and report of broken links are welcome.
Speech to Code - Enables you to code using just your voice.
A repository containing all experiments for the course Compiler Design.
Conversions covered: regex to NFA, NFA to DFA, DFA to regex. Minimizing DFA.
在线可视化地设计、运行自动机,支持DFA和TM Feel free to create & run your DFA and TM🍩Based on React+Next.js+Mobx+Vis Network
Finite State Machine Library for .NET Core (with EASY and ADVANCED implementation)
A repository of my BTech assignments for different papers.
Bicategories of automata, completeness of F-automata in monoidal categories, adjoints between (semi)bicategories; https://arxiv.org/pdf/2303.03867, https://arxiv.org/pdf/2303.03865, https://arxiv.org/abs/2305.00272
A tiny library which contains tools to convert, minimize and visualize Regular Expressions, NFA and DFA.
PHP script with web interface that can optimize & draw your finite automata
This repository contains various programs related to the theory of computation
Context free grammar to pushdown automaton convertor, along with string parser - Theory of Languages and Machines project, spring 2020
A program to convert the given regular expression to Non Definite Automata (NFA)
Implementation of PushDown Automata to track acceptance or rejection of a string.
Java implementation of the CYK algorithm.
Convert LTL formulas into finite-state automata for monitoring
A tool for testing and simulating Deterministic Finite Machines with string inputs
Implementation of a pushdown automaton (PDA) in Java for learning purposes
An android app to create and control emulations of "Connway's Game of Life"
CMP3004 - Formal Languages and Automata Theory Course Project
A C++ library for simulating automata and Turing machines
A basic Implementation of a Deterministic Finite State Automaton (DFA), Non-Deterministic Finite State Automaton (NFA) and Fallback DFA with Actions (FDFA) along with the Left Recursion Elimination algorithm for a Context-Free-Grammar (CFG)
Convert regular expressions to automata effortlessly with Regex2FA. Explore languages, visualize transitions, and compare expressions.
A simulation of mealy and moore machines.
this repository is your go-to resource for CFG(Context-free Grammar) to CNF(Chomsky Normal Form) conversion and the implementation of the CYK(Cocke-Younger-Kasami) algorithm for CFGs.
A programmtic automata renderer and minimizer
This is a simple implementation of turing machine in C++