We introduce a subclass of non deterministic finite automata (NFA) that we call Residual Finite State Automata (RFSA): a RFSA is a NFA all the states of which define residual languages of the language it recognizes. We prove that for every regular language L, there exists a unique RFSA that recognizes L and which has both a minimal number of states and a maximal number of transitions. Moreover,...

Non-deterministic type-2 machines (NDTMs) were suggested by Ziegler [34, 35, 33] as a model for hypercomputation in computable analysis. As demonstrated by Brattka, de Brecht and Pauly [2, 6], the strength of various kinds of type-2 non-deter-minism neatly classifies various important classes of noncomputable functions; and a characterization of such classes as those functions computable by cer...

Seismic inversion is a method that extracts acoustic impedance data from the seismic traces. Source wavelets are band-limited, and thus seismic traces do not contain low and high frequency information. Therefore, there is a serious problem when the deterministic seismic inversion is applied to real data and the result of deterministic inversion is smooth. Low frequency component is obtained fro...