
In this note we present a procedure to rewrite a given Chomsky normal form grammar in Greibach normal form. This procedure yields the same grammar as the well-known procedure of Rosenkrantz, but is based on pure derivation-oriented reasoning and not on systems of equations.
context-free grammar, Greibach normal form, algorithm, Chomsky normal form, pure derivation-oriented reasoning, Formal languages and automata, Theoretical Computer Science, Computer Science(all)
context-free grammar, Greibach normal form, algorithm, Chomsky normal form, pure derivation-oriented reasoning, Formal languages and automata, Theoretical Computer Science, Computer Science(all)
| citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 8 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
