We determine the complexity of learning problems for unary regular languages. We begin by investigating the minimum consistent dfa (resp. nfa) problem which is known not to be app...
One of the open problems listed in Rivest and Schapire, 1989] is whether and how that the copies of L in their algorithm can be combined into one for better performance. This pape...
Autonomics or self-reorganization becomes pertinent for websites serving a large number of users with highly varying workloads. An important component of self-adaptation is to mod...