Tree Transducers and Formal Methods (Dagstuhl Seminar 13192)
暂无分享,去创建一个
[1] Giorgio Satta,et al. The Importance of Rule Restrictions in CCG , 2010, ACL.
[2] Igor Walukiewicz,et al. Unsafe Grammars and Panic Automata , 2005, ICALP.
[3] Didier Caucal. On Infinite Terms Having a Decidable Monadic Theory , 2002, MFCS.
[4] Pawel Parys. Collapse Operation Increases Expressive Power of Deterministic Higher Order Pushdown Automata , 2011, STACS.
[5] Pawel Urzyczyn,et al. Higher-Order Pushdown Trees Are Easy , 2002, FoSSaCS.
[6] Uwe Mönnich. A Logical Characterization of Extended TAGs , 2012, TAG.
[7] Borivoj Melichar,et al. On regular tree languages and deterministic pushdown automata , 2009, Acta Informatica.
[8] Borivoj Melichar,et al. Arbology: Trees and pushdown automata , 2010, Kybernetika.
[9] Marco Kuhlmann,et al. Mildly Non-Projective Dependency Grammar , 2013, CL.
[10] C.-H. Luke Ong,et al. On Model-Checking Trees Generated by Higher-Order Recursion Schemes , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).
[11] Pawel Parys. On the Significance of the Collapse Operation , 2012, 2012 27th Annual IEEE Symposium on Logic in Computer Science.
[12] Andrzej S. Murawski,et al. Collapsible Pushdown Automata and Recursion Schemes , 2008, LICS.
[13] Klaus Aehlig,et al. The Monadic Second Order Theory of Trees Given by Arbitrary Level-Two Recursion Schemes Is Decidable , 2005, TLCA.