| Publication | Date of Publication | Type |
|---|
Dynamic data structures for timed automata acceptance
| 2024-02-12 | Paper |
Dynamic data structures for timed automata acceptance
Algorithmica | 2022-10-27 | Paper |
Origin-equivalence of two-way word transducers is in PSPACE
| 2022-07-21 | Paper |
On Synthesis of Resynchronizers for Transducers
| 2022-07-21 | Paper |
scientific article; zbMATH DE number 7561615 (Why is no real title available?)
| 2022-07-21 | Paper |
The many facets of string transducers (invited talk)
| 2022-07-18 | Paper |
Bounded repairability for regular tree languages
ACM Transactions on Database Systems | 2021-11-25 | Paper |
One-way resynchronizability of word transducers
| 2021-10-18 | Paper |
Resynchronizing classes of word relations
| 2021-07-28 | Paper |
Untwisting two-way transducers in elementary time
| 2021-01-19 | Paper |
scientific article; zbMATH DE number 7003194 (Why is no real title available?)
| 2019-01-18 | Paper |
An algebraic approach to MSO-definability on countable linear orderings
Journal of Symbolic Logic | 2018-10-26 | Paper |
Querying visible and invisible information
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
On the decomposition of finite-valued streaming string transducers
| 2018-04-19 | Paper |
Minimizing resources of sweeping and streaming string transducers
| 2017-12-19 | Paper |
One-way definability of sweeping transducer
| 2017-07-13 | Paper |
Walking on data words
Theory of Computing Systems | 2017-01-18 | Paper |
Which XML schemas are streaming bounded repairable?
Theory of Computing Systems | 2016-04-18 | Paper |
A decidable weakening of compass logic based on cone-shaped cardinal directions
Logical Methods in Computer Science | 2016-01-07 | Paper |
Logics with rigidly guarded data tests
Logical Methods in Computer Science | 2015-10-29 | Paper |
The complexity of higher-order queries
Information and Computation | 2015-09-28 | Paper |
Decidability of the interval temporal logic \(\mathsf{A}\bar{\mathsf{A}}\mathsf{B}\bar{\mathsf{B}}\) over the rationals
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
The per-character cost of repairing word languages
Theoretical Computer Science | 2014-06-06 | Paper |
Bounded repairability of word languages
Journal of Computer and System Sciences | 2014-01-27 | Paper |
Walking on data words
Computer Science – Theory and Applications | 2013-06-14 | Paper |
Decidability of the interval temporal logic \(\operatorname{AB\overline{B}}\) over the natural numbers
| 2012-01-23 | Paper |
On the use of guards for logics with data
Mathematical Foundations of Computer Science 2011 | 2011-08-17 | Paper |
The Cost of Traveling between Languages
Automata, Languages and Programming | 2011-07-07 | Paper |
Regular languages of words over countable linear orderings
Automata, Languages and Programming | 2011-07-07 | Paper |
Maximal decidable fragments of Halpern and Shoham's modal logic of intervals
Automata, Languages and Programming | 2010-09-07 | Paper |
Automata vs. Logics on Data Words
Computer Science Logic | 2010-09-03 | Paper |
Towards compact and tractable automaton-based representations of time granularities.
Lecture Notes in Computer Science | 2010-02-23 | Paper |
Automata for branching and layered temporal structures. An investigation into regularities of infinite transition systems
Lecture Notes in Computer Science | 2010-02-09 | Paper |
On the relationships between theories of time granularity and the monadic second-order theory of one successor
Journal of Applied Non-Classical Logics | 2009-11-30 | Paper |
A Decidable Spatial Logic with Cone-Shaped Cardinal Directions
Computer Science Logic | 2009-11-12 | Paper |
A theory of ultimately periodic languages and automata with an application to time granularity
Acta Informatica | 2009-10-02 | Paper |
Compact and tractable automaton-based representations of time granularities
Theoretical Computer Science | 2007-04-13 | Paper |
Logics in Artificial Intelligence
Lecture Notes in Computer Science | 2006-10-25 | Paper |
FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2005-08-12 | Paper |
