| Publication | Date of Publication | Type |
|---|
Quasi-isometric reductions between infinite strings
Journal of Computer and System Sciences | 2025-12-11 | Paper |
Learnability and positive equivalence relations
Information and Computation | 2024-02-02 | Paper |
Alternating automatic register machines
Lecture Notes in Computer Science | 2023-07-28 | Paper |
Random Subgroups of Rationals
(available as arXiv preprint) | 2022-07-21 | Paper |
A computation model with automatic functions and relations as primitive operations
Theoretical Computer Science | 2022-06-13 | Paper |
The one-cop-moves game on planar graphs
Journal of Combinatorial Optimization | 2021-11-25 | Paper |
Bi-immunity over different size alphabets
Theoretical Computer Science | 2021-11-11 | Paper |
Learnability and positive equivalence relations
(available as arXiv preprint) | 2021-10-04 | Paper |
Ordered semiautomatic rings with applications to geometry
(available as arXiv preprint) | 2020-07-27 | Paper |
Finitely distinguishable erasing pattern languages
Theoretical Computer Science | 2020-01-29 | Paper |
The teaching complexity of erasing pattern languages with bounded variable frequency
(available as arXiv preprint) | 2019-10-15 | Paper |
| On the help of bounded shot verifiers, comparators and standardisers for learnability in inductive inference | 2019-02-06 | Paper |
| Erasing pattern languages distinguishable by a finite number of strings | 2019-01-10 | Paper |
| Preference-based teaching of unions of geometric objects | 2019-01-10 | Paper |
The cop number of the one-cop-moves game on planar graphs
(available as arXiv preprint) | 2018-03-26 | Paper |
On the teaching complexity of linear sets
Theoretical Computer Science | 2018-03-12 | Paper |
Distinguishing pattern languages with membership examples
Information and Computation | 2017-09-28 | Paper |
| Preference-based teaching | 2017-09-27 | Paper |
Preference-based teaching
(available as arXiv preprint) | 2017-09-27 | Paper |
A survey on recent results on partial learning
Proceedings of the 13th Asian Logic Conference | 2017-06-09 | Paper |
On the Teaching Complexity of Linear Sets
Lecture Notes in Computer Science | 2016-11-30 | Paper |
Combining models of approximation with partial learning
Lecture Notes in Computer Science | 2016-11-30 | Paper |
Classifying the arithmetical complexity of teaching models
Lecture Notes in Computer Science | 2016-11-09 | Paper |
Partial learning of recursively enumerable languages
Theoretical Computer Science | 2016-02-26 | Paper |
Confident and consistent partial learning of recursive functions
Theoretical Computer Science | 2014-10-31 | Paper |
Distinguishing pattern languages with membership examples
Language and Automata Theory and Applications | 2014-03-31 | Paper |
Partial learning of recursively enumerable languages
Lecture Notes in Computer Science | 2013-11-06 | Paper |
On conservative learning of recursively enumerable languages
Lecture Notes in Computer Science | 2013-08-05 | Paper |
Confident and Consistent Partial Learning of Recursive Functions
Lecture Notes in Computer Science | 2012-10-16 | Paper |
Learning families of closed sets in matroids
Computation, Physics and Beyond | 2012-06-15 | Paper |
Learnability of co-r.e. classes
Language and Automata Theory and Applications | 2012-06-08 | Paper |
