FSA - Finite State Automaton processing in Python. This package contains functions for manipulating Finite-State Automata (FSAs). It includes functions for minimizing and determinizing FSAs, computing FSA intersections and unions, compiling a (non-POSIX) regular expression into an FSA, and compiling a set of regular expression productions into a chart parser.

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element

References in zbMATH (referenced in 1 article )

Showing result 1 of 1.
Sorted by year (citations)

  1. Heuberger, Clemens; Krenn, Daniel; Kropf, Sara: Automata in SageMath -- combinatorics meet theoretical computer science (2016)