| Publication | Date of Publication | Type |
|---|
| A normalized edit distance on infinite words | 2024-09-25 | Paper |
| The normalized edit distance with uniform operation costs is a metric | 2024-05-06 | Paper |
| Inferring symbolic automata | 2024-04-10 | Paper |
Representing regular languages of infinite words using mod 2 multiplicity automata
Lecture Notes in Computer Science | 2024-01-23 | Paper |
Inferring Symbolic Automata
Logical Methods in Computer Science | 2023-08-26 | Paper |
Learning and characterizing fully-ordered lattice automata
Automated Technology for Verification and Analysis | 2023-06-02 | Paper |
Learning of Structurally Unambiguous Probabilistic Grammars
Logical Methods in Computer Science | 2023-03-22 | Paper |
| scientific article; zbMATH DE number 7650821 (Why is no real title available?) | 2023-02-07 | Paper |
Colored nested words
Formal Methods in System Design | 2022-06-27 | Paper |
| scientific article; zbMATH DE number 7447748 (Why is no real title available?) | 2021-12-17 | Paper |
scientific article; zbMATH DE number 7447748 (Why is no real title available?)
(available as arXiv preprint) | 2021-12-17 | Paper |
Polynomial identification of \(\omega \)-automata
Tools and Algorithms for the Construction and Analysis of Systems | 2021-11-10 | Paper |
Regular \(\omega\)-languages with an informative right congruence
Information and Computation | 2021-06-03 | Paper |
| Query learning of derived \(\omega\)-tree languages in polynomial time | 2020-05-26 | Paper |
Streamable regular transductions
Theoretical Computer Science | 2020-01-22 | Paper |
Query learning of derived \(\omega\)-tree languages in polynomial time
(available as arXiv preprint) | 2019-09-13 | Paper |
Functional specification of hardware via temporal logic
Handbook of Model Checking | 2018-07-20 | Paper |
Inferring regular languages and \(\omega\)-languages
Journal of Logical and Algebraic Methods in Programming | 2018-06-27 | Paper |
| Families of DFAs as Acceptors of omega-Regular Languages | 2018-03-21 | Paper |
Families of DFAs as acceptors of \(\omega\)-regular languages
(available as arXiv preprint) | 2018-02-20 | Paper |
| A modular approach for Büchi determinization | 2017-09-12 | Paper |
Learning regular omega languages
Theoretical Computer Science | 2016-10-21 | Paper |
Regular Programming for Quantitative Properties of Data Streams
Programming Languages and Systems | 2016-04-26 | Paper |
Colored Nested Words
Language and Automata Theory and Applications | 2016-04-13 | Paper |
A complexity measure on Büchi automata
Language and Automata Theory and Applications | 2016-04-13 | Paper |
Vacuity in practice: temporal antecedent failure
Formal Methods in System Design | 2015-03-24 | Paper |
A topological characterization of weakness
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
Learning regular omega languages
Lecture Notes in Computer Science | 2015-01-14 | Paper |
Safety and Liveness, Weakness and Strength, and the Underlying Topological Relations
ACM Transactions on Computational Logic | 2014-07-17 | Paper |
Rational synthesis
Tools and Algorithms for the Construction and Analysis of Systems | 2010-04-27 | Paper |
Reasoning with temporal logic on truncated paths.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Embedding finite automata within regular expressions
Theoretical Computer Science | 2008-10-07 | Paper |
Temporal Antecedent Failure: Refining Vacuity
CONCUR 2007 – Concurrency Theory | 2008-09-18 | Paper |
On Verifying Fault Tolerance of Distributed Protocols
Tools and Algorithms for the Construction and Analysis of Systems | 2008-04-11 | Paper |
Hardware and Software, Verification and Testing
Lecture Notes in Computer Science | 2007-02-12 | Paper |
| scientific article; zbMATH DE number 2081102 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2038760 (Why is no real title available?) | 2004-02-08 | Paper |
| scientific article; zbMATH DE number 1796144 (Why is no real title available?) | 2002-09-04 | Paper |
