Descriptional complexity of multi-continuous grammars

The present paper discusses multi-continuous grammars and their descriptional complexity with respect to the number of nonterminals. It proves that six-nonterminal multi-continuous grammars characterize the family of recursively enumerable languages. In addition, this paper formulates an open problem area closely related to this characterization

Continuous Grammars ; CU-CS-162-79

In this paper we continue the study of selective substitution grammars which form a framework for most of the rewriting systems studied in the literature. The continuous grammars we study in this paper generalize the basic rewriting principle of context free grammars and EOL systems. The paper studies the language generating power of continuous grammars

Regulated Formal Models and Their Reduction

Department of Theoretical Computer Science and Mathematical LogicKatedra teoretické informatiky a matematické logikyFaculty of Mathematics and PhysicsMatematicko-fyzikální fakult