Next Article in Journal
A Supersymmetry and Quantum Cryptosystem with Path Integral Approach in Biology
Previous Article in Journal
Heat Transfer Enhancement in a Novel Annular Tube with Outer Straight and Inner Twisted Oval Tubes

Binary Context-Free Grammars

Department of Computer Science & Software Engineering, College of Information Technology, United Arab Emirates University, Al Ain 15551, UAE
Department of Computer Science, Faculty of Information and Communication Technology, International Islamic University Malaysia, Gombak, Selangor 53100, Malaysia
Faculty of Engineering and Natural Sciences, International University of Sarajevo, 71210 Sarajevo, Bosnia and Herzegovina
Department of Management Information Systems, King Faisal University, Al-Ahsa 31982, Saudi Arabia
Author to whom correspondence should be addressed.
Symmetry 2020, 12(8), 1209;
Received: 17 June 2020 / Revised: 9 July 2020 / Accepted: 21 July 2020 / Published: 24 July 2020
(This article belongs to the Section Computer and Engineering Science and Symmetry/Asymmetry)
A binary grammar is a relational grammar with two nonterminal alphabets, two terminal alphabets, a set of pairs of productions and the pair of the initial nonterminals that generates the binary relation, i.e., the set of pairs of strings over the terminal alphabets. This paper investigates the binary context-free grammars as mutually controlled grammars: two context-free grammars generate strings imposing restrictions on selecting production rules to be applied in derivations. The paper shows that binary context-free grammars can generate matrix languages whereas binary regular and linear grammars have the same power as Chomskyan regular and linear grammars. View Full-Text
Keywords: formal language; binary grammar; context-free grammar; matrix grammar; relational grammar; computation power; chomsky hierarchy formal language; binary grammar; context-free grammar; matrix grammar; relational grammar; computation power; chomsky hierarchy
Show Figures

Figure 1

MDPI and ACS Style

Turaev, S.; Abdulghafor, R.; Amer Alwan, A.; Abd Almisreb, A.; Gulzar, Y. Binary Context-Free Grammars. Symmetry 2020, 12, 1209.

AMA Style

Turaev S, Abdulghafor R, Amer Alwan A, Abd Almisreb A, Gulzar Y. Binary Context-Free Grammars. Symmetry. 2020; 12(8):1209.

Chicago/Turabian Style

Turaev, Sherzod, Rawad Abdulghafor, Ali Amer Alwan, Ali Abd Almisreb, and Yonis Gulzar. 2020. "Binary Context-Free Grammars" Symmetry 12, no. 8: 1209.

Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

Back to TopTop