LANGAGE: A 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 pack ages for processing automata and finite semigroups. (C) 2000 Elsevier Science B.V. All rights reserved.
regular languages algorithms automata locally testable languages