𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Possible edges of a finite automaton defining a given regular language

✍ Scribed by Melnikov, B. F. ;Sciarini-Guryanova, N. V.

Publisher
Springer-Verlag
Year
2002
Tongue
English
Weight
143 KB
Volume
9
Category
Article
ISSN
1226-0061

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

LANGAGE: A maple package for automaton c
LANGAGE: A maple package for automaton characterization of regular languages
✍ 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