Abstract
Centralized parallel communicating grammar systems with context-sensitive components that work in returning mode can only generate context-sensitive languages. Here we show that, when working in nonreturning mode, these grammar systems generate all languages from the nondeterministic time complexity class NEXT = ∪c ≥ 1 NTIME (2c·n).
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Foundations of Computer Science
Paper Title
Journal
Date
