Some structural aspects of hypergraph languages generated by hyperedge replacement
4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87
The complexity of graph languages generated by hyperedge replacement
Acta Informatica
The string generating power of context-free hypergraph grammars
Journal of Computer and System Sciences
On multiple context-free grammars
Theoretical Computer Science
Basic simple type theory
Handbook of formal languages, vol. 3
Handbook of formal languages, vol. 3
Hyperedge replacement graph grammars
Handbook of graph grammars and computing by graph transformation
A short introduction to intuitionistic logic
A short introduction to intuitionistic logic
Hyperedge Replacement: Grammars and Languages
Hyperedge Replacement: Grammars and Languages
Tree Languages Generated be Context-Free Graph Grammars
TAGT'98 Selected papers from the 6th International Workshop on Theory and Application of Graph Transformations
Characterizing mildly context-sensitive grammar formalisms
Characterizing mildly context-sensitive grammar formalisms
Linear context-free rewriting systems and deterministic tree-walking transducers
ACL '92 Proceedings of the 30th annual meeting on Association for Computational Linguistics
On the Expressive Power of Abstract Categorial Grammars: Representing Context-Free Formalisms
Journal of Logic, Language and Information
Towards abstract categorial grammars
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Closure properties of linear context-free tree languages with an application to optimality theory
Theoretical Computer Science - Algebraic methods in language processing
Lectures on the Curry-Howard Isomorphism, Volume 149 (Studies in Logic and the Foundations of Mathematics)
Abstract Families of Abstract Categorial Languages
Electronic Notes in Theoretical Computer Science (ENTCS)
The complexity and generative capacity of lexicalized abstract categorial grammars
LACL'05 Proceedings of the 5th international conference on Logical Aspects of Computational Linguistics
Fundamenta Informaticae - Logic, Language, Information and Computation
LACL'12 Proceedings of the 7th international conference on Logical Aspects of Computational Linguistics
Second position clitics and monadic second-order transduction
ATANLP '12 Proceedings of the Workshop on Applications of Tree Automata Techniques in Natural Language Processing
| Hi-index | 0.00 |
Second-order abstract categorial grammars (de Groote in Association for computational linguistics, 39th annual meeting and 10th conference of the European chapter, proceedings of the conference, pp. 148---155, 2001) and hyperedge replacement grammars (Bauderon and Courcelle in Math Syst Theory 20:83---127, 1987; Habel and Kreowski in STACS 87: 4th Annual symposium on theoretical aspects of computer science. Lecture notes in computer science, vol 247, Springer, Berlin, pp 207---219, 1987) are two natural ways of generalizing "context-free" grammar formalisms for string and tree languages. It is known that the string generating power of both formalisms is equivalent to (non-erasing) multiple context-free grammars (Seki et al. in Theor Comput Sci 88:191---229, 1991) or linear context-free rewriting systems (Weir in Characterizing mildly context-sensitive grammar formalisms, University of Pennsylvania, 1988). In this paper, we give a simple, direct proof of the fact that second-order ACGs are simulated by hyperedge replacement grammars, which implies that the string and tree generating power of the former is included in that of the latter. The normal form for tree-generating hyperedge replacement grammars given by Engelfriet and Maneth (Graph transformation. Lecture notes in computer science, vol 1764. Springer, Berlin, pp 15---29, 2000) can then be used to show that the tree generating power of second-order ACGs is exactly the same as that of hyperedge replacement grammars.