Descriptional complexity of rewriting P systems

Authors:
Mutyam Madhu
Affiliations:
International Institute of Information Technology, Gachibowli, Hyderabad, India
Venue:
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems
Year:
2004

Citing 4
Cited 0

Computing with membranes

Journal of Computer and System Sciences
Grammar Systems: A Grammatical Approach to Distribution and Cooperation

Grammar Systems: A Grammatical Approach to Distribution and Cooperation
Regulated Rewriting in Formal Language Theory

Regulated Rewriting in Formal Language Theory
On three variants of rewriting P systems

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we generalize to rewriting P systems some measures of descriptional complexity defined for context-free grammars and analyze these measures in lieu with those for the context-free grammars.