| Publication | Date of Publication | Type |
|---|
| Parsing unranked tree languages, folded once | 2024-05-29 | Paper |
Tree-Based Generation of Restricted Graph Languages
International Journal of Foundations of Computer Science | 2024-02-16 | Paper |
Transduction from trees to graphs through folding
Information and Computation | 2024-02-02 | Paper |
| scientific article; zbMATH DE number 7568231 (Why is no real title available?) | 2022-08-04 | Paper |
| Learning algorithms | 2022-02-04 | Paper |
Uniform parsing for hyperedge replacement grammars
Journal of Computer and System Sciences | 2021-03-10 | Paper |
Uniform \textit{vs.} nonuniform membership for mildly context-sensitive languages: a brief survey
Algorithms | 2019-03-26 | Paper |
Conjunctive query containment over trees using schema information
Acta Informatica | 2018-02-28 | Paper |
| scientific article; zbMATH DE number 6819785 (Why is no real title available?) | 2017-12-18 | Paper |
| On the regularity and learnability of ordered DAG languages | 2017-08-22 | Paper |
Compression of finite-state automata through failure transitions
Theoretical Computer Science | 2016-06-27 | Paper |
Between a rock and a hard place -- uniform parsing for hyperedge replacement DAG grammars
Language and Automata Theory and Applications | 2016-04-13 | Paper |
Shuffled languages -- representation and recognition
Theoretical Computer Science | 2013-12-19 | Paper |
Validity of tree pattern queries with respect to schema information
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
Cuts in regular expressions
Developments in Language Theory | 2013-06-28 | Paper |
The tractability frontier for NFA minimization
Journal of Computer and System Sciences | 2012-05-11 | Paper |
Recognizing Shuffled Languages
Language and Automata Theory and Applications | 2011-06-03 | Paper |
Conjunctive query containment over trees
Journal of Computer and System Sciences | 2011-05-04 | Paper |
Algorithmic Properties of Millstream Systems
Developments in Language Theory | 2010-08-31 | Paper |
On notions of regularity for data languages
Theoretical Computer Science | 2010-02-09 | Paper |
Volker Weber
Journal of Logic, Language and Information | 2010-01-06 | Paper |
Perspectives of System Informatics
Lecture Notes in Computer Science | 2010-01-05 | Paper |
Optimizing Conjunctive Queries over Trees Using Schema Information
Lecture Notes in Computer Science | 2009-02-03 | Paper |
Shuffle Expressions and Words with Nested Data
Mathematical Foundations of Computer Science 2007 | 2008-09-17 | Paper |
The Tractability Frontier for NFA Minimization
Automata, Languages and Programming | 2008-08-19 | Paper |
On Notions of Regularity for Data Languages
Fundamentals of Computation Theory | 2008-02-26 | Paper |
Bounded Depth Data Trees
Automata, Languages and Programming | 2007-11-28 | Paper |
A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games
Discrete Applied Mathematics | 2007-02-19 | Paper |
Combinatorial structure and randomized subexponential algorithms for infinite games
Theoretical Computer Science | 2006-03-20 | Paper |
Mathematical Foundations of Computer Science 2004
Lecture Notes in Computer Science | 2005-08-22 | Paper |
Memoryless determinacy of parity and mean payoff games: a simple proof
Theoretical Computer Science | 2004-10-27 | Paper |
| scientific article; zbMATH DE number 1962853 (Why is no real title available?) | 2003-08-11 | Paper |
