| Publication | Date of Publication | Type |
|---|
Decidability of membership problems for flat rational subsets of \(\mathrm{GL}(2,\mathbb{Q})\) and singular matrices
SIAM Journal on Computing | 2024-12-12 | Paper |
| On the identity and group problems for complex Heisenberg matrices | 2024-10-23 | Paper |
Decision questions for probabilistic automata on small alphabets
Logical Methods in Computer Science | 2024-01-16 | Paper |
Linear-Time Model Checking Branching Processes
(available as arXiv preprint) | 2023-08-21 | Paper |
| Decision questions for probabilistic automata on small alphabets | 2023-08-08 | Paper |
| On the Identity and Group Problems for Complex Heisenberg Matrices | 2023-07-11 | Paper |
On Reachability Problems for Low-Dimensional Matrix Semigroups
(available as arXiv preprint) | 2022-07-21 | Paper |
| On the mortality problem: from multiplicative matrix equations to linear recurrence sequences and beyond | 2022-07-21 | Paper |
Decidability of Cutpoint Isolation for Probabilistic Finite Automata on Letter-Bounded Inputs.
(available as arXiv preprint) | 2022-07-18 | Paper |
On the mortality problem: from multiplicative matrix equations to linear recurrence sequences and beyond
Information and Computation | 2021-11-25 | Paper |
On the mortality problem: from multiplicative matrix equations to linear recurrence sequences and beyond
Information and Computation | 2021-11-25 | Paper |
Decidability of membership problems for flat rational subsets of GL(2, Q) and singular matrices
Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation | 2021-01-22 | Paper |
| scientific article; zbMATH DE number 7204378 (Why is no real title available?) | 2020-05-26 | Paper |
Vector and scalar reachability problems in \(\operatorname{SL}(2, \mathbb{Z})\)
Journal of Computer and System Sciences | 2019-05-02 | Paper |
Decidability of the membership problem for \(2\times 2\) integer matrices
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Vector reachability problem in \(\operatorname{SL}(2,\mathbb{Z})\)
(available as arXiv preprint) | 2018-03-21 | Paper |
Linear orders realized by c.e. equivalence relations
Journal of Symbolic Logic | 2016-08-19 | Paper |
Algebraic methods proving Sauer's bound for teaching complexity
Theoretical Computer Science | 2014-10-31 | Paper |
Automatic learners with feedback queries
Journal of Computer and System Sciences | 2014-02-13 | Paper |
Automatic models of first order theories
Annals of Pure and Applied Logic | 2013-12-11 | Paper |
Automatic learning of subclasses of pattern languages
Information and Computation | 2012-11-27 | Paper |
Sauer's bound for a notion of teaching complexity
Lecture Notes in Computer Science | 2012-10-16 | Paper |
Automatic Learners with Feedback Queries
Models of Computation in Context | 2011-09-09 | Paper |
Finite automata presentable Abelian groups
Annals of Pure and Applied Logic | 2011-08-26 | Paper |
Automatic learning of subclasses of pattern languages
Language and Automata Theory and Applications | 2011-06-03 | Paper |
Uncountable automatic classes and learning
Theoretical Computer Science | 2011-04-14 | Paper |
Uncountable automatic classes and learning
Lecture Notes in Computer Science | 2009-12-01 | Paper |
Prime models of finite computable dimension
Journal of Symbolic Logic | 2009-03-25 | Paper |
Finite Automata Presentable Abelian Groups
Logical Foundations of Computer Science | 2008-01-04 | Paper |
Applications of Kolmogorov complexity to computable model theory
Journal of Symbolic Logic | 2007-10-17 | Paper |
Applications of Kolmogorov complexity to computable model theory
Journal of Symbolic Logic | 2007-10-17 | Paper |
An uncountably categorical theory whose only computably presentable model is saturated
Notre Dame Journal of Formal Logic | 2006-10-04 | Paper |
^0_1-presentations of algebras
Archive for Mathematical Logic | 2006-09-26 | Paper |
