Tree valence controlled grammars
Beyond a shadow of a doubt, the studying of context-free grammars with restricted derivation trees known as tree controlled grammars have achieved plentiful remarkable results within formal language theory as demonstrated in a number of publications on this subject for the past forty five years. In...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IIUM Press, International Islamic University Malaysia
2017
|
| Subjects: | |
| Online Access: | http://irep.iium.edu.my/58701/ http://irep.iium.edu.my/58701/ http://irep.iium.edu.my/58701/1/58701_Tree%20Valence%20Controlled%20Grammars.pdf |
| id |
iium-58701 |
|---|---|
| recordtype |
eprints |
| spelling |
iium-587012017-10-09T07:19:28Z http://irep.iium.edu.my/58701/ Tree valence controlled grammars Ashaari, Salbiah Turaev, Sherzod Okhunov, Abdurahim QA Mathematics QA75 Electronic computers. Computer science Beyond a shadow of a doubt, the studying of context-free grammars with restricted derivation trees known as tree controlled grammars have achieved plentiful remarkable results within formal language theory as demonstrated in a number of publications on this subject for the past forty five years. In principle, these grammars generate their languages as an ordinary context-free grammar except their derivation trees need to be satisfied by certain prescribed conditions. Our paper is a continuing of studying of this kind of grammars, where we introduce a new variant of tree controlled grammar called a tree valence controlled grammar, which replaces regular sets with valences where every main production with certain integer value will be derived into sub-productions with the value of combination of zero and one or zero and minus represented in matrices form with the permutations of each matrix row yield a zero value (at every level of tree derivation, the summation of valence value is zero). We also investigate the generative capacity and structural properties of these grammars. IIUM Press, International Islamic University Malaysia 2017 Article PeerReviewed application/pdf en http://irep.iium.edu.my/58701/1/58701_Tree%20Valence%20Controlled%20Grammars.pdf Ashaari, Salbiah and Turaev, Sherzod and Okhunov, Abdurahim (2017) Tree valence controlled grammars. International Journal on Perceptive and Cognitive Computing (IJPCC), 3 (1). pp. 15-22. E-ISSN 2462-229X http://journals.iium.edu.my/ijpcc/index.php/IJPCC/article/view/48 |
| repository_type |
Digital Repository |
| institution_category |
Local University |
| institution |
International Islamic University Malaysia |
| building |
IIUM Repository |
| collection |
Online Access |
| language |
English |
| topic |
QA Mathematics QA75 Electronic computers. Computer science |
| spellingShingle |
QA Mathematics QA75 Electronic computers. Computer science Ashaari, Salbiah Turaev, Sherzod Okhunov, Abdurahim Tree valence controlled grammars |
| description |
Beyond a shadow of a doubt, the studying of context-free grammars with restricted derivation trees known as tree controlled grammars have achieved plentiful remarkable results within formal language theory as demonstrated in a number of publications on this subject for the past forty five years. In principle, these grammars generate their languages as an ordinary context-free grammar except their derivation trees need to be satisfied by certain prescribed conditions. Our paper is a continuing of studying of this kind of grammars, where we introduce a new variant of tree controlled grammar called a tree valence controlled grammar, which replaces regular sets with valences where every main production with certain integer value will be derived into sub-productions with the value of combination of zero and one or zero and minus represented in matrices form with the permutations of each matrix row yield a zero value (at every level of tree derivation, the summation of valence value is zero). We also investigate the generative capacity and structural properties of these grammars. |
| format |
Article |
| author |
Ashaari, Salbiah Turaev, Sherzod Okhunov, Abdurahim |
| author_facet |
Ashaari, Salbiah Turaev, Sherzod Okhunov, Abdurahim |
| author_sort |
Ashaari, Salbiah |
| title |
Tree valence controlled grammars |
| title_short |
Tree valence controlled grammars |
| title_full |
Tree valence controlled grammars |
| title_fullStr |
Tree valence controlled grammars |
| title_full_unstemmed |
Tree valence controlled grammars |
| title_sort |
tree valence controlled grammars |
| publisher |
IIUM Press, International Islamic University Malaysia |
| publishDate |
2017 |
| url |
http://irep.iium.edu.my/58701/ http://irep.iium.edu.my/58701/ http://irep.iium.edu.my/58701/1/58701_Tree%20Valence%20Controlled%20Grammars.pdf |
| first_indexed |
2023-09-18T21:23:02Z |
| last_indexed |
2023-09-18T21:23:02Z |
| _version_ |
1777412008541421568 |