✦ LIBER ✦

LANGAGE: A maple package for automaton characterization of regular languages

✍ Scribed by Pascal Caron

Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 95 KB
Volume: 231
Category: Article
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(99)00013-4

No coin nor oath required. For personal study only.

✦ Synopsis

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 ÿnite semigroups.