DSpace Repository

CONCURRENTLY CONTROLLED GRAMMARS

Show simple item record

dc.contributor.author Mavlankulov, Gairatzhan
dc.contributor.author Othman, Mohamed
dc.contributor.author Turaev, Sherzod
dc.contributor.author Selamat, Mohd Hasan
dc.contributor.author Zhumabayeva, Laula
dc.contributor.author Zhukabayeva, Tamara
dc.date.accessioned 2024-12-09T06:09:05Z
dc.date.available 2024-12-09T06:09:05Z
dc.date.issued 2018
dc.identifier.issn 1805-949X
dc.identifier.other DOI: 10.14736/kyb-2018-4-0748
dc.identifier.uri http://rep.enu.kz/handle/enu/19961
dc.description.abstract This paper introduces a new variant of Petri net controlled grammars, namely a concurrently controlled grammar, where the control over the application of the productions of a grammar is realized by a Petri net with different parallel firing strategies. The generative capacity of these grammars is investigated with respect to transition labeling strategies, definitions of final marking sets and parallel transition firing modes. It is shown that the labeling strategies do not effect the computational power whereas the maximal firing modes increase the power of concurrently controlled grammars with erasing rules up to Turing machines. ru
dc.language.iso en ru
dc.publisher Kybernetika ru
dc.relation.ispartofseries V O L U M E 5 4 ( 2 0 1 8 ) , N U M B E R 4 , P A G E S 7 4 8 – 7 6 4;
dc.subject parallel computing ru
dc.subject controlled grammars ru
dc.subject Petri net ru
dc.subject concurrent grammars ru
dc.title CONCURRENTLY CONTROLLED GRAMMARS ru
dc.type Article ru


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Browse

My Account