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

来源：

THEORETICAL COMPUTER SCIENCE | 2000年 / 231卷 / 01期

关键词：

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 条

[21] Regular patterns, regular languages and context-free languages
Jain, Sanjay
Ong, Yuh Shin
Stephan, Frank
INFORMATION PROCESSING LETTERS, 2010, 110 (24) : 1114 - 1119
[22] flexfringe: a passive automaton learning package
Verwer, Sicco
Hammerschmidt, Christian A.
2017 IEEE INTERNATIONAL CONFERENCE ON SOFTWARE MAINTENANCE AND EVOLUTION (ICSME), 2017, : 638 - 642
[23] Automaton representation of linear conjunctive languages
Okhotin, A
DEVELOPMENTS IN LANGUAGE THEORY, 2003, 2450 : 393 - 404
[24] An algebraic characterization of deterministic regular languages over infinite alphabets
Francez, N
Kaminski, M
THEORETICAL COMPUTER SCIENCE, 2003, 306 (1-3) : 155 - 175
[25] FACTORIZATIONS AND UNIVERSAL AUTOMATON OF OMEGA LANGUAGES
Carnino, Vincent
Lombardy, Sylvain
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2014, 25 (08) : 1111 - 1125
[26] A characterization of regular circular languages generated by marked splicing systems
De Felice, Clelia
Fici, Gabriele
Zizza, Rosalba
THEORETICAL COMPUTER SCIENCE, 2009, 410 (47-49) : 4937 - 4960
[27] MAPinsure - A MAPLE package for life insurance
Aschenwald, D
Siegl, T
Tichy, RF
JOURNAL OF SYMBOLIC COMPUTATION, 1996, 22 (02) : 227 - 234
[28] A Maple package for conditional event algebras
Chrzastowski-Wachtel, P
Tyszkiewicz, J
CONDITIONALS, INFORMATION, AND INFERENCE, 2005, : 131 - 151
[29] On the intersection of regex languages with regular languages
Campeanu, Cezar
Santean, Nicolae
THEORETICAL COMPUTER SCIENCE, 2009, 410 (24-25) : 2336 - 2344
[30] The basis automaton for the given regular language
A. A. Vakhitova
Korean Journal of Computational & Applied Mathematics, 1999, 6 (3) : 617 - 624

← 1 2 3 4 5 →