D. J. Rosenkrantz, Matrix equations and normal forms for context-free grammers, JACM 14 (1967), 501--507. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Context-Free Languages and Pushdown Automata - Autebert, Berstel, Boasson (1997) (29 citations) (Correct)
....been proved by Greibach [24] she showed that, given a proper context free grammar, an equivalent contextfree grammar in Greibach normal form can effectively be constructed. The additional statement stating that this grammar can be in quadratic Greibach normal form was proved later by Rosenkrantz [45]. We sketch here the proof he gave; we will see below an alternative proof. Sketch of the construction: We may assume that the grammar is proper and in Chomsky normal form, that is that each right hand side is in A [ V . Consider the associated This may be written as X = XR S S i = P i ....
D.J. Rosenkrantz. Matrix equations and normal forms for context-free grammars. J. Assoc. Comput. Mach., 14:501--507, 1967.
Context-Free Languages and Push-Down Automata - Autebert, Berstel, Boasson (1997) (29 citations) (Correct)
....been proved by Greibach [24] she showed that, given a proper context free grammar, an equivalent contextfree grammar in Greibach normal form can effectively be constructed. The additional statement stating that this grammar can be in quadratic Greibach normal form was proved later by Rosenkrantz [45]. We sketch here the proof he gave; we will see below an alternative proof. Sketch of the construction: We may assume that the grammar is proper and in Chomsky normal form, that is that each right hand side is in A [ V 2 . Consider the associated system of equations X i = P i i = 1; ....
D.J. Rosenkrantz. Matrix equations and normal forms for context-free grammars. J. Assoc. Comput. Mach., 14:501--507, 1967.
Greibach Normal Form Transformation, Revisited - Blum, Koch (1997) (3 citations) (Correct)
....is in Greibach normal form [3, 4, 5, 11] But the usual algorithms possibly construct a context free grammar G 0 , where the size of G 0 is exponential in the size of G (see [4] pp. 113 115 for an example) Given a context free grammar G without rules and without chain rules, Rosenkrantz [9] has given an algorithm which produces an equivalent context free grammar G 0 in Greibach normal form such that jG 0 j = O(jGj 3 ) Rosenkrantz gave no analysis of the size of G 0 . For an analysis, see [4] pp. 129 130 or [7] Given an arbitrary context free grammar G = V; Sigma; P; S) ....
D. J. Rosenkrantz, Matrix equations and normal forms for context-free grammers, JACM 14 (1967), 501--507.
Greibach Normal Form Transformation, Revisited - Koch, Blum (1996) (3 citations) (Correct)
No context found.
D. J. Rosenkrantz, Matrix equations and normal forms for context-free grammers, JACM 14 (1967), 501--507.
Tree Insertion Grammar: A Cubic-Time Parsable Formalism That.. - Schabes, Waters (1994) (15 citations) (Correct)
No context found.
Daniel J. Rosenkrantz. Matrix equations and normal forms for context-free grammars. Journal of the Association for Computing Machinery, 14(3):501--507, 1967.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC