Pavel Semukhin

Log. Methods Comput. Sci., 2023

On the Identity and Group Problems for Complex Heisenberg Matrices.

[BibT_eX]

[DOI]

Proceedings of the Reachability Problems - 17th International Conference, 2023

2021

On the mortality problem: From multiplicative matrix equations to linear recurrence sequences and beyond.

[BibT_eX]

[DOI]

Inf. Comput., 2021

Linear-Time Model Checking Branching Processes.

[BibT_eX]

[DOI]

Stefan Kiefer

Cas Widdershoven

Proceedings of the 32nd International Conference on Concurrency Theory, 2021

2020

Decidability of cutpoint isolation for letter-monotonic probabilistic finite automata.

[BibT_eX]

[DOI]

CoRR, 2020

Decidability of membership problems for flat rational subsets of GL(2, Q) and singular matrices.

[BibT_eX]

[DOI]

Volker Diekert

Proceedings of the ISSAC '20: International Symposium on Symbolic and Algebraic Computation, 2020

Decidability of Cutpoint Isolation for Probabilistic Finite Automata on Letter-Bounded Inputs.

[BibT_eX]

[DOI]

Proceedings of the 31st International Conference on Concurrency Theory, 2020

2019

Vector and scalar reachability problems in SL(2, Z).

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2019

Decidability of the Mortality Problem: from multiplicative matrix equations to linear recurrence sequences and beyond.

[BibT_eX]

[DOI]

CoRR, 2019

On Reachability Problems for Low-Dimensional Matrix Semigroups.

[BibT_eX]

[DOI]

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018

Preface.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2018

2017

Decidability of the Membership Problem for 2 × 2 integer matrices.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Membership Problem in GL(2, Z) Extended by Singular Matrices.

[BibT_eX]

[DOI]

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

2016

Linear Orders Realized by C.E. Equivalence Relations.

[BibT_eX]

[DOI]

J. Symb. Log., 2016

Vector Reachability Problem in SL(2, Z).

[BibT_eX]

[DOI]

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

2014

Algebraic methods proving Sauer's bound for teaching complexity.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Automatic learners with feedback queries.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2014

Sample Compression for Multi-label Concept Classes.

[BibT_eX]

[DOI]

Proceedings of The 27th Conference on Learning Theory, 2014

2013

Automatic models of first order theories.

[BibT_eX]

[DOI]

Frank Stephan

Ann. Pure Appl. Log., 2013

2012

Automatic learning of subclasses of pattern languages.

[BibT_eX]

[DOI]

Inf. Comput., 2012

Sauer's Bound for a Notion of Teaching Complexity.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory - 23rd International Conference, 2012

2011

Uncountable automatic classes and learning.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

2009

Prime models of finite computable dimension.

[BibT_eX]

[DOI]

J. Symb. Log., 2009

Finite automata presentable abelian groups.

[BibT_eX]

[DOI]

André Nies

Ann. Pure Appl. Log., 2009

2007

Applications of Kolmogorov complexity to computable model theory.

[BibT_eX]

[DOI]

Bakhadyr Khoussainov

Frank Stephan

J. Symb. Log., 2007

2006

An Uncountably Categorical Theory Whose Only Computably Presentable Model Is Saturated.

[BibT_eX]

[DOI]

Bakhadyr Khoussainov

Denis R. Hirschfeldt

Notre Dame J. Formal Log., 2006

P<sup>0</sup><sub>1</sub>-Presentations of Algebras.

[BibT_eX]

[DOI]

Bakhadyr Khoussainov

Theodore A. Slaman