Seshat Tool

Seshat Tool contains some of the most common algorithms of lexical analysis taught in language processing courses. It is mainly designed for helping to understand the algorithms by executing them iteratively, step by step.

Build a NDFA from a reg. expr.

Creates a nondeterministic finite automaton from regular expression.

Go »

Convert a NDFA into a DFA

Transforms a nondeterministic finite automaton into a deterministic one.

Go »

Build a DFA from a reg. exp.

Build a deterministic finite automaton from regular expression.

Go »

Automaton minimization

Create an automaton to minimize it later.

Go »

@ARTICLE{SeshatWebTool, title = "Seshat—a web-based educational resource for teaching the most common algorithms of lexical analysis", author = "Arnaiz-Gonz{\'a}lez, {\'A}lvar and D{\'\i}ez-Pastor, Jose-Francisco and Ramos-P{\'e}rez, Ismael and Garc{\'\i}a-Osorio, C{\'e}sar", journal = "Computer Applications in Engineering Education", year = "2018", publisher = "Wiley Online Library", issn = "1099-0542", doi = "https://doi.org/10.1002/cae.22036", }

Seshat Tool

Build a NDFA from a reg. expr.

Convert a NDFA into a DFA

Build a DFA from a reg. exp.

Automaton minimization

Cited this software as:

Authors