| |
|
Description: |
A code over the alphabet A is a nonempty subset of the free monoid over A that freely generates a free submonoid.
In this talk we review some results about the topological closure of codes over A in the free profinite monoid generated by A, and present some applications of such closures to decodings of recurrent languages.
|
|
Date: |
|
| Start Time: |
14:30 |
|
Speaker: |
Alfredo Costa (CMUC, Univ. Coimbra)
|
|
Institution: |
CMUC, University of Coimbra
|
|
Place: |
Sala 5.5, DMUC
|
| Research Groups: |
-Algebra, Logic and Topology
|
|
See more:
|
<Main>
|
|
