| |
| 2006 | ||
|---|---|---|
| 10 | EE | Hans-Jörg Tiede, Stephan Kepser: Monadic Second-Order Logic and Transitive Closure Logics over Trees. Electr. Notes Theor. Comput. Sci. 165: 189-199 (2006) |
| 9 | EE | Stephan Kepser, Uwe Mönnich: Closure properties of linear context-free tree languages with an application to optimality theory. Theor. Comput. Sci. 354(1): 82-97 (2006) |
| 2005 | ||
| 8 | EE | Stephan Kepser: Using MONA for Querying Linguistic Treebanks. HLT/EMNLP 2005 |
| 2004 | ||
| 7 | EE | Stephan Kepser: A Simple Proof for the Turing-Completeness of XSLT and XQuery. Extreme Markup Languages® 2004 |
| 6 | EE | Stephan Kepser: Querying Linguistic Treebanks with Monadic Second-Order Logic in Linear Time. Journal of Logic, Language and Information 13(4): 457-470 (2004) |
| 2003 | ||
| 5 | EE | Stephan Kepser: Finite Structure Query: A Tool for Querying Syntactically Annotated Corpora. EACL 2003: 179-186 |
| 2001 | ||
| 4 | EE | Stephan Kepser: On the Complexity of RSRL. Electr. Notes Theor. Comput. Sci. 53: (2001) |
| 3 | EE | Klaus U. Schulz, Stephan Kepser: Combination of constraint systems II: Rational amalgamation. Theor. Comput. Sci. 266(1-2): 113-157 (2001) |
| 1999 | ||
| 2 | EE | Stephan Kepser, Jörn Richts: UNIMOK: A System for Combining Equational Unification Algorithm. RTA 1999: 248-251 |
| 1996 | ||
| 1 | Stephan Kepser, Klaus U. Schulz: Combination of Constraint Systems II: Rational Amalgamation. CP 1996: 282-296 | |
| 1 | Uwe Mönnich | [9] |
| 2 | Jörn Richts | [2] |
| 3 | Klaus U. Schulz | [1] [3] |
| 4 | Hans-Jörg Tiede | [10] |