Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Binary Context-Free Grammars
View through CrossRef
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.
Title: Binary Context-Free Grammars
Description:
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.
Related Results
Evolutionary Grammatical Inference
Evolutionary Grammatical Inference
Grammatical Inference (also known as grammar induction) is the problem of learning a grammar for a language from a set of examples. In a broad sense, some data is presented to the ...
Tree-Verifiable Graph Grammars
Tree-Verifiable Graph Grammars
Hyperedge-Replacement grammars (HR) have been introduced by Courcelle in order to extend the notion of context-free sets from words and trees to graphs of bounded tree-width. While...
Jezik i gramatološki prinos Lanosovićeve slavonske gramatike u kontekstu standardizacije hrvatskoga jezika
Jezik i gramatološki prinos Lanosovićeve slavonske gramatike u kontekstu standardizacije hrvatskoga jezika
The primary task of this paper was to present, describe and analyze all three editions of Fr. Marijan Lanosović’s grammar as comprehensively and systematically as possible. The gra...
BINARY TOPOLOGY BASED ON SOME NEW SETS
BINARY TOPOLOGY BASED ON SOME NEW SETS
In this chapter, we introduce and some new sets called binary -open sets, binary -sets, binary -sets, binary -closed sets, binary -sets and binary -sets , which are simple forms of...
ON A SUPERCLASS OF A-GRAMMARS
ON A SUPERCLASS OF A-GRAMMARS
In this paper we consider a superclass of automaton grammars that can be represented in terms of paths on graphs. With this approach, we assume that vertices of graph are labeled b...
Phrase Structure Grammars
Phrase Structure Grammars
Phrase structure grammars model the internal structure of a sentence in terms of a hierarchically organized representation. The sentence Every boy has a bike, for instance, is take...
History of European Vernacular Grammar Writing
History of European Vernacular Grammar Writing
The grammatization of European vernacular languages began in the Late Middle Ages and Renaissance and continued up until the end of the 18th century. Through this process, grammars...
Frauen + (viel) Grammatik = (viel) Frauengrammatik ? Zur Verbreitung und Typologie spezieller Grammatiken im 18. Jahrhundert
Frauen + (viel) Grammatik = (viel) Frauengrammatik ? Zur Verbreitung und Typologie spezieller Grammatiken im 18. Jahrhundert
ABSTRACT : While the number of grammars produced in German-speaking countries rather exploded in the XVIH^-century, there is only a small corpus of grammars addressed to women and ...