Descriptional Complexity of Semi-Simple Splicing Systems

Semi-simple splicing systems

In 1987 Tom Head [5] introduced the idea of splicing as a generative mechanism in formal language theory. This mechanism was popularized and extensively developed by Gheorghe Păun and his many coworkers, who recognized much of the subtlety and power of this mechanism and who used it as a foundation for the rapidly developing study of DNA based computing. See, for example, [11] and [12]. (The mo...

Descriptional complexity of semi-conditional grammars

The descriptional complexity of semi-conditional grammars is studied. It is proved that every recursively enumerable language is generated by a semi-conditional grammar of degree (2, 1) with no more than seven conditional productions and eight nonterminals.

Descriptional Complexity of Error/Edit Systems

On the Descriptional Complexity of Production Systems

In t h i s paper we f o r m a l i z e d i f f e r e n t methods f o r d e s c r i b i n g c o n t r o l knowledge in p roduc t i on systems by the concept of p r o d u c t i o n system schemes. In t h i s framework these methods are compared from the v iewpo in t o f d e s c r i p t i o n a l comp lex i t y g i v i n g us some i n s i g h t by which means problems can be descr ibed in an easy a...

A Note on the Descriptional Complexity of Semi-Conditional Grammars

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