Binary Context-Free Grammars

Binary Context-Free Grammars

A <i>binary grammar</i> 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 inv...

Full description

Bibliographic Details
Main Authors: Sherzod Turaev, Rawad Abdulghafor, Ali Amer Alwan, Ali Abd Almisreb, Yonis Gulzar
Format: Article
Language:English
Published: MDPI AG 2020-07-01
Series:Symmetry
Subjects:
formal language
binary grammar
context-free grammar
matrix grammar
relational grammar
computation power
Online Access:https://www.mdpi.com/2073-8994/12/8/1209

Internet

https://www.mdpi.com/2073-8994/12/8/1209

Similar Items