Publisher
Springer Science and Business Media LLC
Subject
Linguistics and Language,Philosophy,Computer Science (miscellaneous)
Reference28 articles.
1. Bauderon M., Courcelle B. (1987) Graph expressions and graph rewritings. Mathematical Systems Theory 20: 83–127
2. Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Löding, C. et al. (2007). Tree automata techniques and applications. Available online at http://tata.gforge.inria.fr/ .
3. Courcelle B. (1987) An axiomatic definition of context-free rewriting and its application to NLC graph grammars. Theoretical Computer Science 55: 141–181
4. de Groote, P. (2001). Towards abstract categorial grammars. In Association for computational linguistics, 39th annual meeting and 10th conference of the European chapter, proceedings of the conference (pp. 148–155).
5. de Groote P., Pogodalla S. (2004) On the expressive power of abstract categorial grammars: Representing context-free formalisms. Journal of Logic, Language and Information 13: 421–438
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献