A program to convert the given regular expression to Non Definite Automata (NFA)
-
Updated
Feb 3, 2019 - C++
A program to convert the given regular expression to Non Definite Automata (NFA)
A C++ library for simulating automata and Turing machines
A complete compiler for an object-oriented language with static typing
CMP3004 - Formal Languages and Automata Theory Course Project
This is a simple implementation of turing machine in C++
Finite state automata and regular expressions. Context-free grammars and pushdown automata. Turing machines. Models of computable functions and undecidable problems. The course emphasis is on the theory of computability, especially on showing limits of computation. May be taken for graduate credit.
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 c++ program that takes a dfa as input and output its minimum equivalence states partitions and corresponding minimum state transition table.
The Grail+ Visualizer is a software tool for visualizing finite automata produced by Grail+.
This is a C++ implementation of CYK Algorithm.
📝 Uma maquina de Turing feita pela disciplina Linguagens Formais e Automatos na realização do Bacharelado de Ciencia da Computação
some basic code on Theory Of Computing (Course: cse-312),
NFA Membership; Conversion of Lambda-NFA to Minimal DFA (using Myhill-Nerode Theorem); Conversion of Regular Grammar to NFA
Code to play Rock Paper Scissors against a Finite State Automaton
Implementation of an algorithm that enables finding the minimal deterministic finite automaton that accepts the intersection or union of languages defined by a pair of finite automata.
Object-Oriented Programming Course Project 📚
Advanced programming and algorithmization in C++ ⚔️
A C++ library to create, load, and analyze Deterministic Finite Automata (DFA) with up to 10 states and lowercase letter alphabets. Offers file loading, state modification, and string acceptance checks.
A program that takes a dfa as input and output its minimum equivalence states partitions.
Automata implementations
Add a description, image, and links to the automata-theory topic page so that developers can more easily learn about it.
To associate your repository with the automata-theory topic, visit your repo's landing page and select "manage topics."