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
相关论文
共 50 条
12345