| Publication | Date of Publication | Type |
|---|
| Theoretical computer science: computability, decidability and logic | 2024-09-11 | Paper |
| Theoretical computer science: computational complexity | 2024-09-11 | Paper |
| Randomness and uniform distribution modulo one | 2022-06-08 | Paper |
| The algebra of binary trees is affine complete | 2022-01-27 | Paper |
| Randomness and uniform distribution modulo one | 2021-04-20 | Paper |
| Affine completeness of the algebra of full binary trees | 2021-01-14 | Paper |
| Test sets for equality of terms in the additive structure of ordinals augmented with right multiplication by \(\omega\) | 2020-08-12 | Paper |
| The algebra of complete binary trees is affine complete | 2020-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4584889 | 2018-09-04 | Paper |
| Congruence preserving functions on free monoids | 2017-12-21 | Paper |
| Functionals Using Bounded Information and the Dynamics of Algorithms | 2017-05-16 | Paper |
| Characterizing congruence preserving functions \(\mathbb Z/n\mathbb Z \to \mathbb Z/m\mathbb Z\) via rational polynomials | 2016-10-28 | Paper |
| Wadge hardness in Scott spaces and its effectivization | 2016-07-27 | Paper |
| Borel and Hausdorff hierarchies in topological spaces of Choquet games and their effectivization | 2016-07-27 | Paper |
| Logical theory of the monoid of languages over a non tally alphabet | 2016-05-11 | Paper |
| Newton representation of functions over natural integers having integral difference ratios | 2015-11-17 | Paper |
| Monadic Theory of a Linear Order Versus the Theory of its Subsets with the Lifted Min/Max Operations | 2015-09-22 | Paper |
| Arithmetical Congruence Preservation: From Finite to Infinite | 2015-09-22 | Paper |
| Integral Difference Ratio Functions on Integers | 2015-09-08 | Paper |
| Kolmogorov Complexity in Perspective Part I: Information Theory and Randomness | 2015-05-19 | Paper |
| Logical Theory of the Additive Monoid of Subsets of Natural Integers | 2015-04-14 | Paper |
| On lattices of regular sets of natural integers closed under decrementation | 2014-04-15 | Paper |
| Rational relations having a rational trace on each finite intersection of rational relations | 2012-10-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3224094 | 2012-03-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3113768 | 2012-01-23 | Paper |
| A Topological Approach to Recognition | 2010-09-07 | Paper |
| ASMs and Operational Algorithmic Completeness of Lambda Calculus | 2010-09-03 | Paper |
| Separability of rational relations in \(A^* \times \mathbb N^m\) by recognizable relations is decidable | 2010-01-29 | Paper |
| The decision problem for some logics for finite words on infinite alphabets | 2010-01-15 | Paper |
| The ``equal last letter predicate for words on infinite alphabets and classes of multitape automata | 2009-08-07 | Paper |
| From index sets to randomness in ∅n: random reals and possibly infinite computations part II | 2009-03-25 | Paper |
| Finite \(n\)-tape automata over possibly infinite alphabets: Extending a theorem of Eilenberg et al. | 2009-02-19 | Paper |
| Duality and Equational Theory of Regular Languages | 2008-08-19 | Paper |
| Random reals à la Chaitin with or without prefix-freeness | 2007-10-18 | Paper |
| Decision problems among the main subfamilies of rational relations | 2007-04-10 | Paper |
| Randomness and halting probabilities | 2007-01-19 | Paper |
| Kolmogorov complexity and set theoretical representations of integers | 2006-08-30 | Paper |
| Synchronization of a bounded degree graph of cellular automata with nonuniform delays in time \(D\lfloor \log_mD\rfloor\) | 2006-05-18 | Paper |
| Kolmogorov complexities \(K_{\max}\), \(K_{\min}\) on computable partially ordered sets | 2006-03-24 | Paper |
| Random reals and possibly infinite computations Part I: Randomness in ∅′ | 2006-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4665731 | 2005-04-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4823415 | 2004-10-28 | Paper |
| Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations | 2004-10-27 | Paper |
| Modelization of deterministic rational relations | 2002-07-15 | Paper |
| Kolmogorov complexity and non-determinism | 2002-03-03 | Paper |
| Syntactical truth predicates for second order arithmetic | 2002-01-22 | Paper |
| La théorie élémentaire de la fonction de couplage de Cantor des entiers naturels est décidable | 2001-01-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941148 | 2000-02-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4712964 | 1992-06-25 | Paper |
| Every recursive linear ordering has a copy in DTIME-SPACE(n,log(n)) | 1990-01-01 | Paper |
| Contribution à l'étude d'une conjecture de théorie des nombres par le codage ZBV. (Contribution to the study of a conjecture of number theory by ZBV coding) | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3318128 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3315505 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3671960 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4748139 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4132536 | 1977-01-01 | Paper |
| Intermediate submodels and generic extensions in set theory | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4075461 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5672628 | 1973-01-01 | Paper |
| Combinatorics on ideals and forcing | 1971-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5581602 | 1970-01-01 | Paper |
