On Size Complexity of Context-Free Returning Parallel Communicating Grammar Systems

Erzsébet Csuhaj-Varjú ()
Additional contact information
Erzsébet Csuhaj-Varjú: Hungarian Academy of Sciences, Computer and Automation Research Institute

Chapter Chapter 4 in Where Mathematics, Computer Science, Linguistics and Biology Meet, 2001, pp 37-49 from Springer

Abstract: Abstract We show that there exists a natural number k such that every recursively enumerable language can be generated by a context-free returning parallel communicating grammar system where the number of nonterminals is less than or equal to this constant. Moreover, the component grammars of the system have a limited number of productions. The result demonstrates that context-free returning parallel communicating grammar systems are economical tools for language generation.

Date: 2001
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-94-015-9634-3_4

Ordering information: This item can be ordered from
http://www.springer.com/9789401596343

DOI: 10.1007/978-94-015-9634-3_4

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().