LANGAGE: A maple package for automaton characterization of regular languages

被引:1
|
作者
Caron, P [1 ]
机构
[1] Univ Rouen, Lab Informat Fondamentale & Appliquee Rouen, F-76821 Mt St Aignan, France
关键词
algorithms; automata; locally testable languages; regular languages;
D O I
10.1016/S0304-3975(99)00013-4
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
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 pack ages for processing automata and finite semigroups. (C) 2000 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:5 / 15
页数:11
相关论文
共 50 条
  • [41] BEYOND ω-REGULAR LANGUAGES
    Bojanczyk, Mikolaj
    27TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2010), 2010, 5 : 11 - 16
  • [42] Odometers on regular languages
    Berthe, Valerie
    Rigo, Michel
    THEORY OF COMPUTING SYSTEMS, 2007, 40 (01) : 1 - 31
  • [43] On the Square of Regular Languages
    Cevorova, Kristina
    Jiraskova, Galina
    Krajnakova, Ivana
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, CIAA 2014, 2014, 8587 : 136 - 147
  • [44] Enforcing Regular Languages
    Genova, Daniela
    Hoogeboom, Hendrik Jan
    FUNDAMENTA INFORMATICAE, 2017, 154 (1-4) : 131 - 144
  • [45] REGULAR LANGUAGES IN NC
    BARRINGTON, DAM
    COMPTON, K
    STRAUBING, H
    THERIEN, D
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1992, 44 (03) : 478 - 499
  • [46] DETERMINISTIC REGULAR LANGUAGES
    BRUGGEMANNKLEIN, A
    WOOD, D
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 577 : 173 - 184
  • [47] Regular autodense languages
    Chen-Ming Fan
    C. C. Huang
    H. J. Shyr
    Acta Informatica, 2008, 45 : 467 - 477
  • [48] Regular autodense languages
    Fan, Chen-Ming
    Huang, C. C.
    Shyr, H. J.
    ACTA INFORMATICA, 2008, 45 (7-8) : 467 - 477
  • [49] The genus of regular languages
    Bonfante, Guillaume
    Deloup, Florian
    MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE, 2018, 28 (01) : 14 - 44
  • [50] On the boundary of regular languages
    Jirasek, Jozef
    Jiraskova, Galina
    THEORETICAL COMPUTER SCIENCE, 2015, 578 : 42 - 57