Concepedia

Stephan Kepser

SK

Statistics

Publications

5

Citations

149

H-Index

5

Active since

2003

Affiliations

University of Tübingen(Current)

Stephan Kepser is an author at University of Tübingen specializing in computer science, computing, and abstract syntax trees.

Publications per year

2003–2011

5

Publications

5

A Simple Proof for the Turing-Completeness of XSLT and XQuery

Stephan Kepser · Extreme Markup Languages® · 2004 · 60 citations

Computing, Computer Science, Algorithms +16

Finite structure query

Stephan Kepser · 2003 · 27 citations · Full text

Computing, Computer Science, Computational Linguistics +7

The Equivalence of Tree Adjoining Grammars and Monadic Linear Context-free Tree Grammars

Stephan Kepser, J. H. Rogers · Journal of Logic Language and Information · 2011 · 25 citations

Language Studies, Computer Science, Syntax +11

Closure properties of linear context-free tree languages with an application to optimality theory

Stephan Kepser, Uwe Mönnich · Theoretical Computer Science · 2005 · 22 citations

Computing, Computer Science, Mathematics +16

Querying Linguistic Treebanks with Monadic Second-Order Logic in Linear Time

Stephan Kepser · Journal of Logic Language and Information · 2004 · 15 citations

Language Studies, Computer Science, Linguistics +12

1–5 of 5