ComTech: Computer, Mathematics and Engineering Applications
The purpose of this research was to show that ternary cross bifix free code CBFS3(2m+1) and CBFS3... more The purpose of this research was to show that ternary cross bifix free code CBFS3(2m+1) and CBFS3(2m+2) achieved the maximum for every natural number m. This research was a literature review. A cross bifix free codes was constructed by using Dyck path method which achieved the maximality, that was non-expandable on binary set sequences for appropriate length. This result is obtained by partitioning members of CBFS3(2m+1) and CBFS3(2m+2) and comparing them with the maximality of CBFS2(2m+1) and CBFS2(2m+2). For small length 3, the result also shows that the code CBFS3(3) is optimal.
This research is a qualitative descriptive study. The research subjects consisted of female stude... more This research is a qualitative descriptive study. The research subjects consisted of female students with introverted personality and female students with extrovert personality. The instruments used in this study consisted of a personality test instrument, interview guidelines, and problem solving tasks (TPM). Data collection was carried out by means of contextual problem solving task-based interviews. The data validity test was conducted by means of time triangulation. The data analysis used refers to the 3 flows of data analysis from Milles & Huberman, namely data reduction, data presentation and conclusion drawing. The results of this study can be concluded as follows. Introverted students mentioned all the information contained in the questions correctly in a halting voice, while extrovert students mentioned all the information contained in the questions correctly and smoothly. The two students solved the questions in two ways even though the methods used were routine procedures...
ComTech: Computer, Mathematics and Engineering Applications
The purpose of this research was to show that ternary cross bifix free code CBFS3(2m+1) and CBFS3... more The purpose of this research was to show that ternary cross bifix free code CBFS3(2m+1) and CBFS3(2m+2) achieved the maximum for every natural number m. This research was a literature review. A cross bifix free codes was constructed by using Dyck path method which achieved the maximality, that was non-expandable on binary set sequences for appropriate length. This result is obtained by partitioning members of CBFS3(2m+1) and CBFS3(2m+2) and comparing them with the maximality of CBFS2(2m+1) and CBFS2(2m+2). For small length 3, the result also shows that the code CBFS3(3) is optimal.
ComTech: Computer, Mathematics and Engineering Applications, Jun 30, 2019
The purpose of this research was to show that ternary cross bifix free code CBFS 3 (2m+1) and CBF... more The purpose of this research was to show that ternary cross bifix free code CBFS 3 (2m+1) and CBFS 3 (2m+2) achieved the maximum for every natural number m. This research was a literature review. A cross bifix free codes was constructed by using Dyck path method which achieved the maximality, that was non-expandable on binary set sequences for appropriate length. This result is obtained by partitioning members of CBFS 3 (2m+1) and CBFS 3 (2m+2) and comparing them with the maximality of CBFS 2 (2m+1) and CBFS 2 (2m+2). For small length 3, the result also shows that the code CBFS 3 (3) is optimal.
ComTech: Computer, Mathematics and Engineering Applications
The purpose of this research was to show that ternary cross bifix free code CBFS3(2m+1) and CBFS3... more The purpose of this research was to show that ternary cross bifix free code CBFS3(2m+1) and CBFS3(2m+2) achieved the maximum for every natural number m. This research was a literature review. A cross bifix free codes was constructed by using Dyck path method which achieved the maximality, that was non-expandable on binary set sequences for appropriate length. This result is obtained by partitioning members of CBFS3(2m+1) and CBFS3(2m+2) and comparing them with the maximality of CBFS2(2m+1) and CBFS2(2m+2). For small length 3, the result also shows that the code CBFS3(3) is optimal.
This research is a qualitative descriptive study. The research subjects consisted of female stude... more This research is a qualitative descriptive study. The research subjects consisted of female students with introverted personality and female students with extrovert personality. The instruments used in this study consisted of a personality test instrument, interview guidelines, and problem solving tasks (TPM). Data collection was carried out by means of contextual problem solving task-based interviews. The data validity test was conducted by means of time triangulation. The data analysis used refers to the 3 flows of data analysis from Milles & Huberman, namely data reduction, data presentation and conclusion drawing. The results of this study can be concluded as follows. Introverted students mentioned all the information contained in the questions correctly in a halting voice, while extrovert students mentioned all the information contained in the questions correctly and smoothly. The two students solved the questions in two ways even though the methods used were routine procedures...
ComTech: Computer, Mathematics and Engineering Applications
The purpose of this research was to show that ternary cross bifix free code CBFS3(2m+1) and CBFS3... more The purpose of this research was to show that ternary cross bifix free code CBFS3(2m+1) and CBFS3(2m+2) achieved the maximum for every natural number m. This research was a literature review. A cross bifix free codes was constructed by using Dyck path method which achieved the maximality, that was non-expandable on binary set sequences for appropriate length. This result is obtained by partitioning members of CBFS3(2m+1) and CBFS3(2m+2) and comparing them with the maximality of CBFS2(2m+1) and CBFS2(2m+2). For small length 3, the result also shows that the code CBFS3(3) is optimal.
ComTech: Computer, Mathematics and Engineering Applications, Jun 30, 2019
The purpose of this research was to show that ternary cross bifix free code CBFS 3 (2m+1) and CBF... more The purpose of this research was to show that ternary cross bifix free code CBFS 3 (2m+1) and CBFS 3 (2m+2) achieved the maximum for every natural number m. This research was a literature review. A cross bifix free codes was constructed by using Dyck path method which achieved the maximality, that was non-expandable on binary set sequences for appropriate length. This result is obtained by partitioning members of CBFS 3 (2m+1) and CBFS 3 (2m+2) and comparing them with the maximality of CBFS 2 (2m+1) and CBFS 2 (2m+2). For small length 3, the result also shows that the code CBFS 3 (3) is optimal.
Uploads
Papers by Mohammad Affaf