Sciweavers

4581 search results - page 1 / 917
» Computing Transformation Semigroups
Sort
View
JSC
2002
74views more  JSC 2002»
13 years 4 months ago
Computing Transformation Semigroups
This paper describes algorithms for computing the structure of finite transformation semigroups. The algorithms depend crucially on a new data structure for an R-class in terms of...
Steve Linton, G. Pfeiffer, Edmund F. Robertson, Ni...
DM
2008
102views more  DM 2008»
13 years 5 months ago
Largest subsemigroups of the full transformation monoid
In this paper we are concerned with the following question: for a semigroup S, what is the largest size of a subsemigroup T S where T has a given property? The semigroups S that w...
R. Gray, J. D. Mitchell
DLT
2003
13 years 6 months ago
On Deterministic Finite Automata and Syntactic Monoid Size, Continued
We continue our investigation on the relationship between regular languages and syntactic monoid size. In this paper we confirm the conjecture on two generator transformation semi...
Markus Holzer, Barbara König
STOC
2006
ACM
92views Algorithms» more  STOC 2006»
14 years 5 months ago
On the importance of idempotence
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from so...
Sunil Arya, Theocharis Malamatos, David M. Mount
MFCS
2000
Springer
13 years 8 months ago
Matching Modulo Associativity and Idempotency Is NP-Complete
We show that AI
Ondrej Klíma, Jirí Srba