… -free grammar into Greibach normal form with only polynomial increase of its size; ie, we
don't use any algebraic concept like formal power series. Starting with a cfg G in Chomsky …

… to proving that the second rest:fiction does not limit generative power. … normal form. DE~IN~'rmN
3.2. A psg (I, T, X, CO) is in standard n-form if all of the rules of ~p are of the forms : Z --~ …

… Greibach normal form … power series. In [10] Urbanek has given an algorithm for the
transformation of a given context-free grammar in Chomsky normal form into Greibach normal form …

… normal form theorems for context-free grammars. In particular, we derive the Greibach[11]
normal form … power series of his proof. Our axioms also imply that context-free grammars have …

… Our proof gives the efficient algorithm of Rosenkrantz [26], but avoids the analytic method
of power series of his proof. Our axioms also imply that context-free grammars have …

… Generalized Greibach Normal Form (GGNF), a generalization of the classical Greibach Normat
Form (… The GGNF seems to be the first normal form result for DCGs. It provides an explicit …

… in Greibach m-form (m = 1,2) generating Ln; the argument is similar to the one in [10]. This
lower bound implies that any context-free grammar Gn in Greibach m-form … on the power set of …

… This definition will be used in a number of the proofs which will lead us to the construction
of the Greibach normal form. In many cases the exact structure of such S-rational power series …

… This generalizes Double Greibach Normal Form of context-free grammars. Moreover, it
provides a natural grammatical characterization of the context-free hypergraph languages of …

… In our first main result, we show that (mixed) ω-algebraic systems can be transformed into
Greibach normal form. We use the Greibach normal form in our second main result to prove …