Titlebook: Automata Implementation; Second International Derick Wood,Sheng Yu Conference proceedings 1998 Springer-Verlag Berlin Heidelberg 1998 Autom

novelty

收養(yǎng)

依法逮捕

LANGAGE: A Maple package for automaton characterization of regular languages, 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.

innovation

Femish

An efficient null-free procedure for deciding regular language membership,near in time on the product of the sizes of the expression and of the word, and which does not make use of e-transitions. This procedure is based on a suitable implementation of the Glushkov automaton of the expression. This implementation is computed in linear time and space by the ZPC algorithm designed by Ziadi, Ponty and Champarnaud.

薄膜

Lecture Notes in Computer Sciencehttp://image.papertrans.cn/b/image/166177.jpg

enchant

想象

978-3-540-64694-5Springer-Verlag Berlin Heidelberg 1998

CHECK

Iniquitous