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
| Publié dans: | IEEE transactions on pattern analysis and machine intelligence. - 1979. - 3(1981), 2 vom: 01. Feb., Seite 204-6 |
|---|---|
| Auteur principal: | |
| Autres auteurs: | , |
| Format: | Article |
| Langue: | English |
| Publié: |
1981
|
| Accès à la collection: | IEEE transactions on pattern analysis and machine intelligence |
| Sujets: | Journal Article |
| Résumé: | 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 |
|---|---|
| Description: | Date Completed 02.10.2012 Date Revised 12.11.2019 published: Print Citation Status PubMed-not-MEDLINE |
| ISSN: | 1939-3539 |