Name
Abstract | ||
|---|---|---|
We present a procedure for deciding a sufficient condition for equivalence of context-free grammars. The main focus of the paper is on deciding whether a given functor between two grammars is surjective. An additional theorem gives us the means for deciding a certain type of structural similarity which is defined by the existence of such a functor. |
Year | Venue | Keywords |
|---|---|---|
1976 | Theory of Computing Systems / Mathematical Systems Theory | Computational Mathematic,Additional Theorem |
Field | DocType | Volume |
Context-sensitive grammar,Rule-based machine translation,Tree-adjoining grammar,Discrete mathematics,Combinatorics,Exact functor,Algebra,Functor,Equivalence (measure theory),Mathematics,Surjective function | Journal | 9 |
Issue | ISSN | Citations |
4 | 0025-5661 | 3 |
PageRank | References | Authors |
1.42 | 6 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Eberhard Bertsch | 1 | 63 | 26.54 |