Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. Benedikt, M., Segoufin, L.: Regular tree languages definable in FO and in FOmod. ACM Transactions in Computational Logic 11, 1–32 (2009)
2. Chomsky, N.: The Minimalist Program. MIT Press, Cambridge (1995)
3. den Dikken, M.: Arguments for successive-cyclic movement through SpecCP. A critical review. Linguistic Variation Yearbook 9, 89–126 (2009)
4. Lecture Notes in Computer Science (LNAI);T. Graf,2011
5. Gécseg, F., Steinby, M.: Tree Automata. Academei Kaido, Budapest (1984)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献