There are 2 repositories under jflap topic.
Implementation of Turing Machines in jFlap 8.1 for the "Computability and Complexity" exam
Sono state realizzate alcune Turing machines che risolvono alcuni problemi di natura matematica
Exercises for the course of Computability and Complexity. Turing machines on JFLAP.
Extension of JFLAP. Provides command line interface, automaton and words generation and JSON results. Written in Kotlin.
:flags: Conversor capaz de traduzir Autômatos Finitos Não Determinísticos em Autômatos Finitos Determinísticos. Projeto desenvolvido utilizando PyQt e JsonSchema, compatível com formatos JFLAP.
This is a Morse code translator which is implemented using the Turing machine in Jflap software.
Command line tool for generating JFLAP files containing random FA's.
A simple tool to convert NDFA(Non-deterministic Finite Automaton)(without Lambda(or Epilson) Transitions) into DFA(Deterministic Finite Automaton), both using JFLAP's simulator file format.
Turing machine developed in JFLAP for flight simple time calculation.
Language theory and compilation introduction TPs.
Programa para gerar equivalencias entre automatos de pilha que acietam por estado final e os que aceitam por pilha vazia.
A repository for the LING123: Language and Computers Lab Sessions website.
Trabalho de Teoria da computação. - Maquina de Turing em JFLAP que calcula o horário de chegada a um lugar com fuso horário diferente.
Designing Pushdown Automata and Turing machine for Safe Submarine Battle
Translate between JFLAP, LaTeX, parsingEmulator and Context-free grammar-checker (Calgary) format
Automaton designed using Jflap that models Deterministic Pushdown Automata
Raccolta esercizi svolti in jflap 8 beta durante il corso di Automi e Linguaggi Formali.
University related exercises and projects.
Final Project for CSCI333: Theory of Computation at St. Olaf College, Spring 2017
A WPF version of the popular JFLAP Educational Tool. This is currently under development
Collection of 3 solo homework assignments from my Formal Languages and Computability class.
Design and implement a Universal Turing Machine that simulates running any arbitrary first in-first out automata again any arbitrary string
Collection of all projects done up to date in Computer Science and Engineering at the UC3M