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

A Note on the Descriptional Complexity of Semi-Conditional Grammars

Abstract. The descriptional complexity of semi-conditional grammars is studied. A proof that every recursively enumerable language is gener-lji";'I":ff ffi ru*::?H:"ffi Xl,?li".ffi f iJ,,-,T?,ll,J"'"'n'&quot