Chomsky normal form
Form for context-free grammars
In formal language theory, a context-free grammar, G, is said to be in Chomsky normal form (first described by Noam Chomsky) if all of its production rules are of the form: A → BC, or A → a, or S → ε, where A, B, and C are nonterminal symbols, the letter a is a terminal symbol (a symbol that represents a constant value), S is the start symbol, and ε denotes the empty string. Also, neither B nor C may be the start symbol, and the third production rule can only appear if ε is in L(G), the language produced by the context-free grammar G. Every gra...
Nº Q1076039 ★
Common · Knowledge
Chomsky normal form
Form for context-free grammars
In formal language theory, a context-free grammar, G, is said to be in Chomsky normal form (first described by Noam Chomsky) if all of its production rules are of the form: A → BC, or A → a, or S → ε, where A, B, and C are nonterminal symbols, the letter a is a terminal symbol (a symbol that represents a constant value), S is the start symbol, and ε denotes the empty string. Also, neither B nor C may be the start symbol, and the third production rule can only appear if ε is in L(G), the language produced by the context-free grammar G. Every gra...
From Wikipedia
In formal language theory, a context-free grammar, G, is said to be in Chomsky normal form (first described by Noam Chomsky) if all of its production rules are of the form: A → BC, or A → a, or S → ε, where A, B, and C are nonterminal symbols, the letter a is a terminal symbol (a symbol that represents a constant value), S is the start symbol, and ε denotes the empty string. Also, neither B nor C may be the start symbol, and the third production rule can only appear if ε is in L(G), the language produced by the context-free grammar G. Every grammar in Chomsky normal form is context-free, and conversely, every context-free grammar can be transformed into an equivalent one which is in Chomsky normal form and has a size no larger than the square of the original grammar's size.
Text: Wikipédia, CC BY-SA 4.0. ·
Related cards
-
Chomsky hierarchy
Containment hierarchy of classes of formal grammars
Nº Q190913 ★★★
Not listed
-
C
Conjunctive normal form
Concept in Boolean logic
Nº Q846564 ★★
Not listed
-
Probability axioms
Axioms that are relevant to the probability theory
Nº Q974605 ★★
Not listed
-
C
Chomskybot
Nº Q5104458 ★
Not listed
-
Compactness theorem
Theorem
Nº Q1149458 ★
Not listed
-
Equilibrium constant
Chemical property
Nº Q857809 ★★
Not listed