TY - JOUR AU - Ashaari, Salbiah AU - TURAEV, SHERZOD AU - Okhunov, Abdurahim PY - 2017/07/20 Y2 - 2024/03/29 TI - Tree Valence Controlled Grammars JF - International Journal on Perceptive and Cognitive Computing JA - IJPCC VL - 3 IS - 1 SE - Articles DO - 10.31436/ijpcc.v3i1.48 UR - https://journals.iium.edu.my/kict/index.php/IJPCC/article/view/48 SP - AB - Beyond a shadow of a doubt, the studying of context-free grammars with restricted derivation<br />trees known as tree controlled grammars have achieved plentiful remarkable results within formal<br />language theory as demonstrated in a number of publications on this subject for the past forty five years.<br />In principle, these grammars generate their languages as an ordinary context-free grammar except their<br />derivation trees need to be satisfied by certain prescribed conditions. Our paper is a continuing of studying<br />of this kind of grammars, where we introduce a new variant of tree controlled grammar called a tree<br />valence controlled grammar, which replaces regular sets with valences where every main production with<br />certain integer value will be derived into sub-productions with the value of combination of zero and one or<br />zero and minus represented in matrices form with the permutations of each matrix row yield a zero value<br />(at every level of tree derivation, the summation of valence value is zero). We also investigate the<br />generative capacity and structural properties of these grammars.<br /><br /> ER -