Results 31 to 40 of about 266 (53)

On the Complexity of the Word Problem for Automaton Semigroups and Automaton Groups

open access: yes, 2017
In this paper, we study the word problem for automaton semigroups and automaton groups from a complexity point of view. As an intermediate concept between automaton semigroups and automaton groups, we introduce automaton-inverse semigroups, which are ...
D'Angeli, Daniele   +2 more
core   +1 more source

On surjunctive monoids

open access: yes, 2014
A monoid $M$ is called surjunctive if every injective cellular automata with finite alphabet over $M$ is surjective. We show that all finite monoids, all finitely generated commutative monoids, all cancellative commutative monoids, all residually finite ...
Ceccherini-Silberstein, Tullio   +1 more
core   +3 more sources

Semigroup identities of tropical matrices through matrix ranks

open access: yes, 2018
We prove the conjecture that, for any $n$, the monoid of all $n \times n$ tropical matrices satisfies nontrivial semigroup identities. To this end, we prove that the factor rank of a large enough power of a tropical matrix does not exceed the tropical ...
Izhakian, Zur, Merlet, Glenn
core  
Some of the next articles are maybe not open access.

Related searches:

⋂-large pseudo injective acts

Journal of Discrete Mathematical Sciences and Cryptography, 2022
Ahmed Amer
exaly  

Partial category actions on sets and topological spaces

Communications in Algebra, 2018
Patrik Nystedt
exaly  

An approach to injective acts over monoids based on indecomposability

Communications in Algebra, 2017
Mojtaba Sedaghatjoo   +1 more
exaly  

Home - About - Disclaimer - Privacy