In this paper, a scattered context grammar generating all powers of 2 is given.
The present paper suggests a new investigation area of the formal language theory—regulated automata. Specifically, it investigates pushdown automata that regulate the use of their rules by control languages. It proves that this regulation has no effect on the power of pushdown automata if the control languages are regular. However, the pushdown automata… (More)