513 search results - page 6 / 103 » Finitely Based, Finite Sets of Words |
ISSAC
1998
Springer
14 years 19 days ago
1998
Springer
This note presents a new algorithm for the computation of the set of normal subgroups of a finite group. It is based on lifting via homomorphic images.
JUCS
2002
13 years 8 months ago
2002
: The problem about the synchronization of a finite deterministic automaton is not yet properly understood. The present paper investigates this and related problems within the gene...
ACL
2008
13 years 10 months ago
2008
In morphologically rich languages such as Arabic, the abundance of word forms resulting from increased morpheme combinations is significantly greater than for languages with fewer...
AGI
2011
13 years 1 days ago
2011
Under Legg’s and Hutter’s formal measure [1], performance in easy environments counts more toward an agent’s intelligence than does performance in difficult environments. An ...
PODS
1991
ACM
13 years 12 months ago
1991
ACM
In this paper we characterise exactly the complexity of a set based database language called SRL, which presents a unified framework for queries and updates. By imposing simple s...