LANGAGEA Maple package for automaton characterization of regular languages. LANGAGE is a set of procedures for deciding whether or not a language given by its minimal automaton is piecewise testable, locally testable, strictly locally testable, or strongly locally testable. New polynomial algorithms are implemented for the two last properties. This package is written using the symbolic computation system Maple. It works with AG, a set of Maple packages for processing automata and finite semigroups.

References in zbMATH (referenced in 1 article )

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

  1. Trahtman, A.N.: Reducing the time complexity of testing for local threshold testability (2004)