๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The basis automaton for the given regular language

โœ Scribed by Vakhitova, A. A.


Publisher
Springer-Verlag
Year
1999
Tongue
English
Weight
120 KB
Volume
6
Category
Article
ISSN
1226-0061

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


LANGAGE: A maple package for automaton c
โœ Pascal Caron ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 95 KB

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