33 search results - page 3 / 7 » Compositions of Random Functions on a Finite Set |
ICWS
2010
IEEE
13 years 3 months ago
2010
IEEE
A service-oriented application is composed of multiple web services to fulfill complex functionality that cannot be provided by individual web service. The combination of services ...
ALT
2009
Springer
14 years 2 months ago
2009
Springer
We consider the problem of learning a finite automaton M of n states with input alphabet X and output alphabet Y when a teacher has helpfully or randomly labeled the states of M u...
CAV
2006
Springer
13 years 9 months ago
2006
Springer
We propose and evaluate a new algorithm for checking the universality of nondeterministic finite automata. In contrast to the standard algorithm, which uses the subset construction...
CP
2000
Springer
13 years 9 months ago
2000
Springer
We are interested in the expressiveness of constraints represented by general first order formulae, with equality as unique relation symbol and function symbols taken from an infi...
BMCBI
2007
13 years 5 months ago
2007
Background: False occurrences of functional motifs in protein sequences can be considered as random events due solely to the sequence composition of a proteome. Here we use a nume...