4581 search results - page 4 / 917 » Computing Transformation Semigroups |
ACS
2010
13 years 7 months ago
2010
The class Md of sequentially dense monomorphisms were first defined and studied by Giuli, Ebrahimi, and Mahmoudi for projection algebras (acts over the monoid (N , min), of interes...
SIAMCOMP
2012
11 years 9 months ago
2012
Let S be a set of n intervals in R, and let (S, +) be any commutative semigroup. We assign a weight ω(s) ∈ S to each interval in S. For a point x ∈ R, let S(x) ⊆ S be the se...
TCS
2010
13 years 2 months ago
2010
The theorem of factorization forests of Imre Simon shows the existence of nested factorizations -- `a la Ramsey -- for finite words. This theorem has important applications in sem...
STACS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. This paper solves the unambiguity and the sequentiality problem for polynomially ambiguous min-plus automata. This result is proved through a decidable algebraic characte...
FCT
2007
Springer
13 years 11 months ago
2007
Springer
The theorem of factorisation forests shows the existence of nested factorisations -- a la Ramsey -- for finite words. This theorem has important applications in semigroup theory, a...