|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'501'711
Articles rated: 2609
20 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
Eraser morphisms and membership problem in groups and monoids | | Daniele D'Angeli
; Emanuele Rodaro
; Pedro V. Silva
; Alexander Zakharov
; | | Date: |
4 Oct 2019 | | Abstract: | We develop the theory of fragile words by introducing the concept of eraser
morphism and extending the concept to more general contexts such as (free)
inverse monoids. We characterize the image of the eraser morphism in the free
group case, and show that it has decidable membership problem. We establish
several algorithmic properties of the class of finite-${cal{J}}$-above
(inverse) monoids. We prove that the image of the eraser morphism in the free
inverse monoid case (and more generally, in the finite-${cal{J}}$-above case)
has decidable membership problem, and relate its kernel to the free group
fragile words. | | Source: | arXiv, 1910.2134 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER