It is known that the weakly monotone restarting automata accept exactly the growing contextsensitive langauges. We introduce a measure on the degree of weak monotonicity and show that the language classes obtained in this way form strict hierarchies for the various types of deterministic and nondeterministic restarting automata without auxiliary symbols.

In this paper, we present a new algorithm, which is called electromagnetism meta-heuristic restarted Arnoldi algorithm (EM-RA) for calculating eigenvalues and eigenvectors of a non-symmetric matrix. In most of the restarting methods the basic idea is a selection of the best initial eigenvector, but our aim is to improve the initial eigenvectors in each iteration of the restarting method. Numeri...

Restarting automata were introduced for modeling linguistically motivated analysis by reduction. In this paper we enhance these automata with a structured output in the form of a tree. Enhanced restarting automata can serve as a formal framework for the Functional Generative Description. In this framework, a natural language is described at four layers. Working simultaneously with all these lay...