AUTOMATE, A COMPUTING PACKAGE FOR AUTOMATA AND FINITE-SEMIGROUPS

被引：24
作者：
CHAMPARNAUD, JM [1 ]
HANSEL, G [1 ]
机构：
[1] FAC SCI & TECH ROUEN, DEPT MATH, F-76130 MT ST AIGNAN, FRANCE
来源：
JOURNAL OF SYMBOLIC COMPUTATION | 1991年 / 12卷 / 02期
关键词：
D O I：
10.1016/S0747-7171(08)80125-3
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
AUTOMATE is a package for symbolic computation on finite automata, extended rational expressions and finite semigroups. On the one hand, it enables one to compute the deterministic minimal automaton of the language represented by a rational expression or given by its table. On the other hand, given the transition table of a deterministic automaton, AUTOMATE computes the associated transition monoid. The regular D-classes structure, and many properties of the elements in the monoid are provided. The program AUTOMATE has been written in C and is quite portable. The user interface includes specialized editors for easy displaying of the computed results. © 1991, Academic Press Limited. All rights reserved.
引用
收藏
页码：197 / 220
页数：24
相关论文
共 25 条
  • [1] Aho A., 1976, DESIGN ANAL COMPUTER
  • [2] ALAIWAN H, 1983, THESIS U PARIS 7
  • [3] BEAL MP, 1988, LITP8835 U PAR 7 RAP
  • [4] Berstel J., 1979, TRANSDUCTIONS CONTEX
  • [5] CHAMPARNAUD JM, 1985, LITP8548 RAPP
  • [6] CHAMPARNAUD JM, 1988, LITP8845BIS RAPP
  • [7] CHAMPARNAUD JM, 1988, LITP8844 RAPP
  • [8] COUSINEAU G, ACTES C APL 73
  • [9] Eilenberg S, 1974, AUTOMATA LANGUAGES M
  • [10] THE COMPILATION OF REGULAR EXPRESSIONS INTO INTEGRATED-CIRCUITS
    FLOYD, RW
    ULLMAN, JD
    [J]. JOURNAL OF THE ACM, 1982, 29 (03) : 603 - 622
123