Stephan Kepser Finite Structure Query: A Tool for Querying Syntactically Annotated Corpora. [Citation Graph (0, 0)][DBLP] EACL, 2003, pp:179-186 [Conf]

Stephan Kepser A Simple Proof for the Turing-Completeness of XSLT and XQuery. [Citation Graph (0, 0)][DBLP] Extreme Markup Languages®, 2004, pp:- [Conf]

Stephan Kepser Querying Linguistic Treebanks with Monadic Second-Order Logic in Linear Time. [Citation Graph (0, 0)][DBLP] Journal of Logic, Language and Information, 2004, v:13, n:4, pp:457-470 [Journal]

Stephan Kepser, Uwe Mönnich Closure properties of linear context-free tree languages with an application to optimality theory. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2006, v:354, n:1, pp:82-97 [Journal]