Routes and products of monoids

被引：0

作者：

Mateescu, Alexandru ^{[1
]}

Freund, Rudolf ^{[1
]}

机构：

[1] Vienna Univ Technol, Inst Comp Sprachen, A-1040 Vienna, Austria

来源：

FUNDAMENTA INFORMATICAE | 2006年 / 73卷 / 1-2期

关键词：

monoid; route; Schutzenberger product; shuffle; SHUFFLE; TRAJECTORIES; OPERATIONS;

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

We investigate the problem of finding monoids that recognize languages of the form L-1 x L-T(2) where T is an arbitrary set of routes. We present a uniform method based on routes to find such monoids. Many classical operations from the theory of formal languages, such as catenation, bi-catenation, simple splicing, shuffle, literal shuffle, and insertion are shown to be just particular instances of the operation x(T).

引用

页码：205 / 211

页数：7

共 12 条

[1] Harju T, 1998, LECT NOTES COMPUT SC, V1450, P503, DOI 10.1007/BFb0055800
[2] Kari L., 1991, THESIS U TURKU TURKU
[3] KECECIOGLU J, 1994, PROCEEDINGS OF THE FIFTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, P471
[4] Mateescu A, 1998, SPR S DISC MATH, P273
[5] Simple splicing systems
Mateescu, A
Paun, G
Rozenberg, G
Salomaa, A
[J]. DISCRETE APPLIED MATHEMATICS, 1998, 84 (1-3) : 145 - 163
[6] Shuffle on trajectories: Syntactic constraints
Mateescu, A
Rozenberg, G
Salomaa, A
[J]. THEORETICAL COMPUTER SCIENCE, 1998, 197 (1-2) : 1 - 56
[7] On the interdependence between shuffle and crossing-over operations
Mitrana, V
[J]. ACTA INFORMATICA, 1997, 34 (04) : 257 - 266
[8] Computing by splicing
Paun, G
Rozenberg, G
Salomaa, A
[J]. THEORETICAL COMPUTER SCIENCE, 1996, 168 (02) : 321 - 336
[9] Pin, 1986, VARIETIES FORMAL LAN
[10] Pin Jean-Eric., 1996, HDB FORMAL LANGUAGES, VI, P679, DOI DOI 10.1007/978-3-642-59136-5_10

← 1 2 →