On centralized PC grammar systems with context-sensitive components

Authors:
Friedrich Otto
Affiliations:
Fachbereich Elektrotechnik/Informatik, Universität Kassel, Kassel, Germany
Venue:
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Year:
2012

Citing 3
Cited 0

Structural complexity 1

Structural complexity 1
Grammar systems

Handbook of formal languages, vol. 2
Grammar Systems: A Grammatical Approach to Distribution and Cooperation

Grammar Systems: A Grammatical Approach to Distribution and Cooperation

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is known that in returning mode centralized PC grammar systems with context-sensitive components only generate context-sensitive languages. Here we show that the class of languages that are generated by centralized PC grammar systems with context-sensitive components working in nonreturning mode coincides with the complexity class NEXT=∪c≥1NTIME(2c·n).