The SCEAS System
Navigation Menu

Search the dblp DataBase


Stephan Kepser: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Stephan Kepser, Klaus U. Schulz
    Combination of Constraint Systems II: Rational Amalgamation. [Citation Graph (0, 0)][DBLP]
    CP, 1996, pp:282-296 [Conf]
  2. Stephan Kepser
    Finite Structure Query: A Tool for Querying Syntactically Annotated Corpora. [Citation Graph (0, 0)][DBLP]
    EACL, 2003, pp:179-186 [Conf]
  3. Stephan Kepser
    A Simple Proof for the Turing-Completeness of XSLT and XQuery. [Citation Graph (0, 0)][DBLP]
    Extreme Markup Languages®, 2004, pp:- [Conf]
  4. Stephan Kepser
    Using MONA for Querying Linguistic Treebanks. [Citation Graph (0, 0)][DBLP]
    HLT/EMNLP, 2005, pp:- [Conf]
  5. Stephan Kepser, Jörn Richts
    UNIMOK: A System for Combining Equational Unification Algorithm. [Citation Graph (0, 0)][DBLP]
    RTA, 1999, pp:248-251 [Conf]
  6. Stephan Kepser
    On the Complexity of RSRL. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2001, v:53, n:, pp:- [Journal]
  7. Hans-Jörg Tiede, Stephan Kepser
    Monadic Second-Order Logic and Transitive Closure Logics over Trees. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:165, n:, pp:189-199 [Journal]
  8. 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]
  9. 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]
  10. Klaus U. Schulz, Stephan Kepser
    Combination of constraint systems II: Rational amalgamation. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:266, n:1-2, pp:113-157 [Journal]

  11. On Monadic Second-Order Theories of Multidominance Structures. [Citation Graph (, )][DBLP]

  12. The Equivalence of Tree Adjoining Grammars and Monadic Linear Context-Free Tree Grammars. [Citation Graph (, )][DBLP]

Search in 0.002secs, Finished in 0.003secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002