J. Albert, D. Giammarresi, and D. Wood. Normal form algorithms for extended context-free grammars. Theoretical Computer Science, 267:35-- 47, 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Normal Form for XML Documents - Arenas, Libkin (19 citations) (Correct)
....[26, 29] We use FDs and relational algebra queries over incomplete relations using the techniques from [3, 7, 15, 19, 21] XML constraints (mostly keys) have been studied in [5, 6, 12] these constraints do not use DTDs. XML constraints that takes DTDs into account are studied in [11] Finally, [2] considers normal forms for extended context free grammars similar to the Greibach normal form for CFGs; these, however, do not necessarily guarantee good XML design. 2 Notations Assume that we have the following disjoint sets: El of element names, Att of attribute names, Str of possible values ....
J. Albert, D. Giammarresi, D. Wood. Normal form algorithms for extended context-free grammars. TCS 267 (2001), 35-47.
A Normal Form for XML Documents - Arenas, Libkin (19 citations) (Correct)
....[26, 29] We use FDs and relational algebra queries over incomplete relations using the techniques from [3, 7, 15, 19, 21] XML constraints (mostly keys) have been studied in [5, 6, 12] these constraints do not use DTDs. XML constraints that takes DTDs into account are studied in [11] Finally, [2] considers normal forms for extended context free grammars similar to the Greibach normal form for CFGs; these, however, do not necessarily guarantee good XML design. 2 Notations Assume that we have the following disjoint sets: El of element names, Att of attribute names, Str of possible values ....
J. Albert, D. Giammarresi, D. Wood. Normal form algorithms for extended context-free grammars. TCS 267 (2001), 35-47.
Structural Equivalence of Regularly Extended E0L Grammars: An.. - Salomaa, Wood (2003) Self-citation (Wood) (Correct)
No context found.
J. Albert, D. Giammarresi and D. Wood, Normal form algorithms for extended contextfree grammars, Theoretical Computer Science 267 (2001) 35--47.
Attribute Grammars for Unranked Trees as a query language for.. - Neven (Correct)
No context found.
J. Albert, D. Giammarresi, and D. Wood. Normal form algorithms for extended context-free grammars. Theoretical Computer Science, 267:35-- 47, 2001.
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