| Publication | Date of Publication | Type |
|---|
| MSO+\( \nabla \) is undecidable | 2024-12-19 | Paper |
| Transducers of polynomial growth | 2024-12-06 | Paper |
| Algebraic recognition of regular functions | 2024-11-14 | Paper |
| Monadic monadic second order logic | 2024-10-01 | Paper |
Orbit-finite-dimensional vector spaces and weighted register automata
TheoretiCS | 2024-07-03 | Paper |
String-to-string interpretations with polynomial-size output
(available as arXiv preprint) | 2022-07-21 | Paper |
| scientific article; zbMATH DE number 7559390 (Why is no real title available?) | 2022-07-18 | Paper |
scientific article; zbMATH DE number 7471715 (Why is no real title available?)
(available as arXiv preprint) | 2022-02-09 | Paper |
| scientific article; zbMATH DE number 7471715 (Why is no real title available?) | 2022-02-09 | Paper |
| Algebra for trees | 2022-02-04 | Paper |
Definable decompositions for graphs of bounded linear cliquewidth
(available as arXiv preprint) | 2021-03-26 | Paper |
| Definable decompositions for graphs of bounded linear cliquewidth | 2021-03-26 | Paper |
Extensions of \(\omega \)-regular languages
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-21 | Paper |
First-order tree-to-tree functions
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-21 | Paper |
On computability and tractability for infinite sets
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-20 | Paper |
Regular and First-Order List Functions
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-20 | Paper |
Regular and First-Order List Functions
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-20 | Paper |
Definable decompositions for graphs of bounded linear cliquewidth
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-20 | Paper |
| scientific article; zbMATH DE number 7204453 (Why is no real title available?) | 2020-05-27 | Paper |
| Which classes of origin graphs are generated by transducers | 2020-05-27 | Paper |
Emptiness of zero automata is decidable
(available as arXiv preprint) | 2020-05-27 | Paper |
| scientific article; zbMATH DE number 7168170 (Why is no real title available?) | 2020-02-17 | Paper |
scientific article; zbMATH DE number 7168170 (Why is no real title available?)
(available as arXiv preprint) | 2020-02-17 | Paper |
scientific article; zbMATH DE number 7168148 (Why is no real title available?)
(available as arXiv preprint) | 2020-02-17 | Paper |
A non-regular language of infinite trees that is recognizable by a sort-wise finite algebra
(available as arXiv preprint) | 2020-01-03 | Paper |
Regular tree languages in low levels of the Wadge hierarchy
(available as arXiv preprint) | 2019-09-13 | Paper |
Definability equals recognizability for graphs of bounded treewidth
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
Decomposition theorems and model-checking for the modal \(\mu\)-calculus
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) | 2018-04-23 | Paper |
Star height via games
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
| scientific article; zbMATH DE number 6862107 (Why is no real title available?) | 2018-04-19 | Paper |
scientific article; zbMATH DE number 6829362 (Why is no real title available?)
(available as arXiv preprint) | 2018-01-24 | Paper |
It is Undecidable if Two Regular Tree Languages can be Separated by a Deterministic Tree-walking Automaton
Fundamenta Informaticae | 2018-01-19 | Paper |
| Thin MSO with a probabilistic path quantifier | 2017-12-19 | Paper |
Boundedness in languages of infinite words
(available as arXiv preprint) | 2017-12-11 | Paper |
Turing machines with atoms
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science | 2017-07-03 | Paper |
| Regular languages of thin trees | 2017-01-30 | Paper |
| Imperative programming in sets with atoms | 2017-01-26 | Paper |
| Decidable classes of documents for XPath | 2017-01-26 | Paper |
Rigidity is undecidable
Mathematical Structures in Computer Science | 2016-07-26 | Paper |
Regular languages of thin trees
Theory of Computing Systems | 2016-06-03 | Paper |
Two-variable logic on data trees and XML reasoning
Journal of the ACM | 2015-11-11 | Paper |
Recognisable languages over monads
Developments in Language Theory | 2015-11-10 | Paper |
Containment of monadic Datalog programs via bounded clique-width
Automata, Languages, and Programming | 2015-11-04 | Paper |
Two-variable logic on data words
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Towards nominal computation
Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2015-09-11 | Paper |
Automata theory in nominal sets
Logical Methods in Computer Science | 2014-09-05 | Paper |
Transducers with Origin Information
Automata, Languages, and Programming | 2014-07-01 | Paper |
Weak MSO+U with path quantifiers over infinite trees
Automata, Languages, and Programming | 2014-07-01 | Paper |
On the decidability of MSO+U on infinite trees
Automata, Languages, and Programming | 2014-07-01 | Paper |
XPath evaluation in linear time
Journal of the ACM | 2014-02-17 | Paper |
Solutions in XML data exchange
Journal of Computer and System Sciences | 2014-01-20 | Paper |
Nominal monoids
Theory of Computing Systems | 2013-10-21 | Paper |
Modelling infinite structures with atoms
Logic, Language, Information, and Computation | 2013-09-17 | Paper |
Fraenkel-Mostowski sets with non-homogeneous atoms
Lecture Notes in Computer Science | 2013-01-07 | Paper |
Ramsey's theorem for colors from a metric space
Semigroup Forum | 2012-11-08 | Paper |
Regular languages of infinite trees that are Boolean combinations of open sets
Automata, Languages, and Programming | 2012-11-01 | Paper |
Toward model theory with data values
Automata, Languages, and Programming | 2012-11-01 | Paper |
A Machine-Independent Characterization of Timed Languages
Automata, Languages, and Programming | 2012-11-01 | Paper |
| Deterministic automata and extensions of weak MSO | 2012-10-24 | Paper |
Piecewise testable tree languages
Logical Methods in Computer Science | 2012-10-22 | Paper |
Wreath products of forest algebras, with applications to tree logics
Logical Methods in Computer Science | 2012-09-25 | Paper |
| Weak \(\text{MSO}+U\) over infinite trees | 2012-08-23 | Paper |
Finite satisfiability for guarded fixpoint logic
Information Processing Letters | 2012-07-20 | Paper |
| Weak MSO with the unbounding quantifier | 2012-04-24 | Paper |
An extension of data automata that captures XPath
Logical Methods in Computer Science | 2012-04-03 | Paper |
| Data monoids | 2012-01-23 | Paper |
| Beyond $\omega$-Regular Languages | 2012-01-23 | Paper |
Weak MSO with the unbounding quantifier
Theory of Computing Systems | 2011-05-23 | Paper |
| scientific article; zbMATH DE number 5872386 (Why is no real title available?) | 2011-03-30 | Paper |
Tree languages defined in first-order logic with one quantifier alternation
Logical Methods in Computer Science | 2010-12-20 | Paper |
Efficient evaluation of nondeterministic automata using factorization forests
Automata, Languages and Programming | 2010-09-07 | Paper |
Tree-walking automata do not recognize all regular languages
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
On the Borel complexity of MSO definable sets of branches
Fundamenta Informaticae | 2010-05-25 | Paper |
A new algorithm for testing if a regular language is locally threshold testable
Information Processing Letters | 2010-03-24 | Paper |
Algebra for Infinite Forests with an Application to the Temporal Logic EF
CONCUR 2009 - Concurrency Theory | 2009-10-22 | Paper |
Two-Way Unary Temporal Logic over Trees
Logical Methods in Computer Science | 2009-08-20 | Paper |
FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2009-08-06 | Paper |
Factorization Forests
Developments in Language Theory | 2009-07-07 | Paper |
Tree-Walking Automata Do Not Recognize All Regular Languages
SIAM Journal on Computing | 2009-04-30 | Paper |
Expressive Power of Pebble Automata
Automata, Languages and Programming | 2009-03-12 | Paper |
Forest Expressions
Computer Science Logic | 2009-03-05 | Paper |
Tree-Walking Automata
Language and Automata Theory and Applications | 2008-11-20 | Paper |
Shuffle Expressions and Words with Nested Data
Mathematical Foundations of Computer Science 2007 | 2008-09-17 | Paper |
Tree languages defined in first-order logic with one quantifier alternation
Lecture Notes in Computer Science | 2008-08-19 | Paper |
The Common Fragment of ACTL and LTL
Foundations of Software Science and Computational Structures | 2008-04-11 | Paper |
Bounded Depth Data Trees
Automata, Languages and Programming | 2007-11-28 | Paper |
Reachability in Unions of Commutative Rewriting Systems Is Decidable
STACS 2007 | 2007-09-03 | Paper |
Characterizing EF and EX tree logics
Theoretical Computer Science | 2006-09-13 | Paper |
Tree-walking automata cannot be determinized
Theoretical Computer Science | 2006-03-20 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
CONCUR 2004 - Concurrency Theory
Lecture Notes in Computer Science | 2005-08-23 | Paper |
Computer Science Logic
Lecture Notes in Computer Science | 2005-08-22 | Paper |
| scientific article; zbMATH DE number 2086675 (Why is no real title available?) | 2004-08-11 | Paper |
The finite graph problem for two-way alternating automata.
Theoretical Computer Science | 2003-05-25 | Paper |
| scientific article; zbMATH DE number 1701347 (Why is no real title available?) | 2002-02-05 | Paper |
Function spaces for orbit-finite sets
(available as arXiv preprint) | N/A | Paper |
