|
| << previous | next >> |
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
Details for article 19 of 25 found articles
| Title: |
Routes and Products of Monoids |
| Author: |
Mateescu, Alexandru Freund, Rudolf |
| Appeared in: |
Fundamenta informaticae |
| Paging: | Volume 73 (2006) nr. 1-2 pages 205-211 |
| Year: |
2006-08-28 |
| Contents: |
We investigate the problem of finding monoids that recognize languages of the form L_1⋈_TL_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 ⋈_T. |
| Publisher: |
IOS Press |
| Source file: |
Elektronische Wetenschappelijke Tijdschriften |
Details for article 19 of 25 found articles
| << previous | next >> |