https://github.com/niols/toytomata

An executable and library to help with automata courses
https://github.com/niols/toytomata

Last synced: 15 days ago
JSON representation

An executable and library to help with automata courses

• Host: GitHub
• URL: https://github.com/niols/toytomata
• Owner: Niols
• Created: 2021-03-05T11:53:06.000Z (over 3 years ago)
• Default Branch: main
• Last Pushed: 2021-05-26T18:26:10.000Z (over 3 years ago)
• Last Synced: 2023-02-26T17:12:05.901Z (over 1 year ago)
• Language: OCaml
• Homepage:
• Size: 401 KB
• Stars: 1
• Watchers: 2
• Forks: 0
• Open Issues: 5
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
Toytomata

=========

*Work in Progress*

Toytomata is an executable and a library that aim at helping with automata

courses. The goal is to allow both students and teachers to enter

language-related objects (automata, regular expressions, grammars, etc.) in a

simple way and to run some usual operations on them. The main usage is to help

check that different objects (and automaton and a grammar, for instance)

recognise the same language, or to give a counter-example. This can be useful

when grading, for instance, to compare a solution with the problem statement.

The API documentation is available [here](https://niols.github.io/toytomata/).

Installation [![Build Status](https://github.com/colis-anr/morbig/actions/workflows/ci.yml/badge.svg?branch=main&event=push)](https://github.com/Niols/toytomata/actions)

------------

The only way to install this software is currently manually, by downloading the

sources, installing the dependencies and building the project.

See Also

--------

- [Automata Tutor v3](https://automata-tutor.model.in.tum.de/), a website

  containing automatically-checked exercises on language-related objects.

- [Automaton Simulator](http://automatonsimulator.com/), a website which allows

  you to define automata using a graphical interface and to check whether they

  recognise words or not.

- [CFG](https://mmottl.github.io/cfg/), an OCaml library for analysing and

  manipulating context-free grammars.

References

----------

**[Aho *et al.* 1983]** Alfred V. Aho, John E. Hopcroft and Jeffrey D. Ullman.

*Data Structures and Algorithms*. Addison-Wesley, 1983.

**[Lange & Leiß 2009]** Martin Lange and Hans Leiß. “To CNF or not to CNF? An

Efficient Yet Presentable Version of the CYK Algorithm”. In *Informatica

Didactica*, volume 8, 2009.

http://ddi.cs.uni-potsdam.de/InformaticaDidactica/LangeLeiss2009.pdf

**[Paull & Unger 1968]** Marvin C. Paull and Stephen H. Unger. “Structural

equivalence of context-free grammars”. In *Journal of Computer and System

Sciences*, volume 2, issue 4, December 1968, pages 427-463.

https://doi.org/10.1016/S0022-0000(68)80037-6