Analysis by reduction is a linguistically motivated method for checking correctness of a sentence. It can be modelled by restarting automata. In this paper we propose a method for learning of restarting automata which are strictly locally testable (SLT-R-automata). The method is based on the concept of identification in the limit from positive examples only. Also we characterize the class of la...

The GMRES method for solving nonsymmetric linear equations is generally used with restarting to reduce storage and orthogonalization costs. Restarting slows down the convergence. However, it is possible to save some important information at the time of the restart. It is proposed that approximate eigenvectors corresponding to a few of the smallest eigenvalues be formed and added to the subspace...

We present observations of two radio galaxies, J1835+620 and 3C338, both with signs of having passed through different stages of core activity. The former presents two symmetric and bright components within a typical FR II structure, possibly resulting from two distinct phases of activity; the latter is a FR I radio galaxy with two separated regions with different age properties, possibly due t...

Following some previous studies on restarting automata, we introduce a refined model – the hlexicalized restarting automaton (h-RLWW). We argue that this model is useful for expressing lexicalized syntax in computational linguistics. We compare the input languages, which are the languages traditionally considered in automata theory, to the so-called basic and h-proper languages, which are (impl...