We show that deterministic finite automata (DFAs) with n states and input alphabet \Sigma can efficiently be learned from less than j\Sigmajn 2 smallest counterexamples. This improves on an earlier re...
Over the years, a number of numerical models have been implemented with the original or equivalent forms of the Boussinesq wave equations. Their verifications however, have been carried out mainly for...
I hereby declare that I did this thesis on my own, using no other sources than the ones cited. Hiermit erkl?re ich, dass ich diese Arbeit selbstst?ndig und ohne Verwendung anderer als der angegebenen ...
Over the years, a number of numerical models have been implemented with the original or equivalent forms of the Boussinesq wave equations. Their verifications however, have been carried out mainly for...
Abstract. This paper describes the PRIMME software package for the solving large, sparse Hermitian and real symmetric eigenvalue problems. The difficulty and importance of these problems have increase...