We introduce and study the notion of j-monotonicity of RRand RRW -automata (special types of restarting automata without working symbols). We show that the j-monotonicity can be considered as a degree of non-context-freeness of languages recognized by RRW -automata and RR-automata. 1-monotonic RRW -automata recognize a subset of the class of context-free languages. For j > 1, the j-monotonic RR...

Advanced Automata Theory is a lecture which will first review the basics of formal languages and automata theory and then give insight into specific topics from the theory of automata theory. In computer science, automata are an important tool for many theoretical results and various types of automata have been used to characterise complexity classes. The lecture will give a deeper understandin...

The main goal of this paper is to develop tools for constructing different kinds of abstract automata based on cellular automata. We call this engineering problem cellular engineering. Different levels of computing systems and models are considered. The emphasis is made on the toplevel model called a grid automaton. Our goal is to construct grid automata using cellular automata. To achieve this...

Inoue et al. introduced an automaton on a twodimensional tape, which decides acceptance or rejection of an input tape by scanning the tape from various sides by various automata which move one way, and investigated the accepting power of such an automaton. This paper continues the investigation of this type of automata, especially, ∨-type automata (obtained by combining four three-way two-dimen...