A Variant of Team Cooperation in Grammar Systems

dc.creatorFreund,Rudolf
dc.creatorPaun,Gheorghe
dc.date1995
dc.date.accessioned2024-02-06T12:47:34Z
dc.date.available2024-02-06T12:47:34Z
dc.descriptionWe prove that grammar systems with (prescribed or free) teams (of constant size at least two or arbitrary size) working as long as they can do, characterize the family of languages generated by (context-free) matrix grammars with appearance checking; in this way, the results in [Paun, Rozenberg 1994] are completed and improved.
dc.formattext/html
dc.identifierhttps://doi.org/10.3217/jucs-001-02-0105
dc.identifierhttps://lib.jucs.org/article/27099/
dc.identifier.urihttps://openrepository.mephi.ru/handle/123456789/6730
dc.languageen
dc.publisherJournal of Universal Computer Science
dc.relationinfo:eu-repo/semantics/altIdentifier/eissn/0948-6968
dc.relationinfo:eu-repo/semantics/altIdentifier/pissn/0948-695X
dc.rightsinfo:eu-repo/semantics/openAccess
dc.rightsJ.UCS License
dc.sourceJUCS - Journal of Universal Computer Science 1(2): 105-130
dc.subjectFormal languages
dc.subjectgrammar systems
dc.subjectteams
dc.titleA Variant of Team Cooperation in Grammar Systems
dc.typeResearch Article
Файлы
Коллекции