Equivalence and reduction of expansive tree grammars
The equivalence of nonterminals of an expansive tree grammar is considered. Algorithms are presented for constructing sets of equivalent nonterminals for an expansive tree grammar, for reducing the grammar, and for determining whether two grammars generate the same language
| Veröffentlicht in: | IEEE transactions on pattern analysis and machine intelligence. - 1979. - 3(1981), 2 vom: 01. Feb., Seite 204-6 |
|---|---|
| 1. Verfasser: | |
| Weitere Verfasser: | , |
| Format: | Aufsatz |
| Sprache: | English |
| Veröffentlicht: |
1981
|
| Zugriff auf das übergeordnete Werk: | IEEE transactions on pattern analysis and machine intelligence |
| Schlagworte: | Journal Article |