Java Library With Implementations Of Various Automata, Data Structures And Sorting Algorithms
-
Updated
Nov 25, 2014 - Java
Java Library With Implementations Of Various Automata, Data Structures And Sorting Algorithms
Framework for creating automatons
A program to remove epsilon productions from a Context Free Grammar (CFG)
Bee colony simulator, implemented as a multi-agent system.
Turing Machine (and Automata) simulator.
Project for Formal Languages & Automata Theory course.
The submitted code for team project 2015
Write a program that, given an arithmetic expression, first transforms it to a postfix form, and then computes its value (by using the stack-based algorithms that we recalled in class).
Write a program that simulates a finite automaton based on the user's specification. Your program should ask for:
A small, but flexible, lexical and syntax analizer
A program in Java and QT Jambi to convert an NFA to a DFA and minimize it
Contains coursework for the Theory Of Computation course offered at Shiv Nadar University.
Universal Turing Machine (UTM) - Version 1.1
Deterministic Finite Automaton that works recursively to do union, intersection and complement operations
Reachability checking for Timed Automata using Region Graphs
Print on the terminal the Serpinski triangle based on rules (Interface implementing)
Add a description, image, and links to the automata topic page so that developers can more easily learn about it.
To associate your repository with the automata topic, visit your repo's landing page and select "manage topics."