| 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
Information and Computation | 2022-06-08 | Paper |
The algebra of binary trees is affine complete
Discrete Mathematics & Theoretical Computer Science | 2022-01-27 | Paper |
The algebra of binary trees is affine complete
Discrete Mathematics & Theoretical Computer Science | 2022-01-27 | Paper |
Randomness and uniform distribution modulo one
(available as arXiv preprint) | 2021-04-20 | Paper |
Affine completeness of the algebra of full binary trees
Algebra Universalis | 2021-01-14 | Paper |
Test sets for equality of terms in the additive structure of ordinals augmented with right multiplication by
Algebra Universalis | 2020-08-12 | Paper |
| The algebra of complete binary trees is affine complete | 2020-05-18 | Paper |
| Classes of algorithms: formalization and comparison | 2018-09-04 | Paper |
Congruence preserving functions on free monoids
Algebra Universalis | 2017-12-21 | Paper |
Functionals using bounded information and the dynamics of algorithms
2012 27th Annual IEEE Symposium on Logic in Computer Science | 2017-05-16 | Paper |
Characterizing congruence preserving functions Z/n Z Z/m Z via rational polynomials
Integers | 2016-10-28 | Paper |
Characterizing congruence preserving functions Z/n Z Z/m Z via rational polynomials
Integers | 2016-10-28 | Paper |
Wadge hardness in Scott spaces and its effectivization
Mathematical Structures in Computer Science | 2016-07-27 | Paper |
Borel and Hausdorff hierarchies in topological spaces of Choquet games and their effectivization
Mathematical Structures in Computer Science | 2016-07-27 | Paper |
Logical theory of the monoid of languages over a non tally alphabet
Fundamenta Informaticae | 2016-05-11 | Paper |
Newton representation of functions over natural integers having integral difference ratios
International Journal of Number Theory | 2015-11-17 | Paper |
Monadic theory of a linear order versus the theory of its subsets with the lifted min/max operations
Fields of Logic and Computation II | 2015-09-22 | Paper |
Arithmetical congruence preservation: from finite to infinite
Fields of Logic and Computation II | 2015-09-22 | Paper |
Integral Difference Ratio Functions on Integers
Computing with New Resources | 2015-09-08 | Paper |
Kolmogorov complexity in perspective. I: Information theory and randomness
Logic, Epistemology, and the Unity of Science | 2015-05-19 | Paper |
Logical Theory of the Additive Monoid of Subsets of Natural Integers
Automata, Universality, Computation | 2015-04-14 | Paper |
On lattices of regular sets of natural integers closed under decrementation
Information Processing Letters | 2014-04-15 | Paper |
Rational relations having a rational trace on each finite intersection of rational relations
Theoretical Computer Science | 2012-10-11 | Paper |
| scientific article; zbMATH DE number 6019540 (Why is no real title available?) | 2012-03-29 | Paper |
| scientific article; zbMATH DE number 5999715 (Why is no real title available?) | 2012-01-23 | Paper |
A topological approach to recognition
Automata, Languages and Programming | 2010-09-07 | Paper |
ASMs and operational algorithmic completeness of lambda calculus
Fields of Logic and Computation | 2010-09-03 | Paper |
Separability of rational relations in A^* N^m by recognizable relations is decidable
Information Processing Letters | 2010-01-29 | Paper |
The decision problem for some logics for finite words on infinite alphabets
Journal of Mathematical Sciences (New York) | 2010-01-15 | Paper |
The ``equal last letter'' predicate for words on infinite alphabets and classes of multitape automata
Theoretical Computer Science | 2009-08-07 | Paper |
From index sets to randomness in ∅<sup>n</sup>: random reals and possibly infinite computations part II
Journal of Symbolic Logic | 2009-03-25 | Paper |
Finite n-tape automata over possibly infinite alphabets: Extending a theorem of Eilenberg et al.
Theoretical Computer Science | 2009-02-19 | Paper |
Duality and Equational Theory of Regular Languages
Automata, Languages and Programming | 2008-08-19 | Paper |
Random reals à la Chaitin with or without prefix-freeness
Theoretical Computer Science | 2007-10-18 | Paper |
Decision problems among the main subfamilies of rational relations
RAIRO - Theoretical Informatics and Applications | 2007-04-10 | Paper |
Decision problems among the main subfamilies of rational relations
RAIRO - Theoretical Informatics and Applications | 2007-04-10 | Paper |
Decision problems among the main subfamilies of rational relations
RAIRO - Theoretical Informatics and Applications | 2007-04-10 | Paper |
Randomness and halting probabilities
Journal of Symbolic Logic | 2007-01-19 | Paper |
Kolmogorov complexity and set theoretical representations of integers
Mathematical Logic Quarterly | 2006-08-30 | Paper |
Synchronization of a bounded degree graph of cellular automata with nonuniform delays in time \(D\lfloor \log_mD\rfloor\)
Theoretical Computer Science | 2006-05-18 | Paper |
Kolmogorov complexities \(K_{\max}\), \(K_{\min}\) on computable partially ordered sets
Theoretical Computer Science | 2006-03-24 | Paper |
Random reals and possibly infinite computations Part I: Randomness in ∅′
Journal of Symbolic Logic | 2006-01-16 | Paper |
| scientific article; zbMATH DE number 2155184 (Why is no real title available?) | 2005-04-11 | Paper |
| scientific article; zbMATH DE number 2111977 (Why is no real title available?) | 2004-10-28 | Paper |
Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations
Theoretical Computer Science | 2004-10-27 | Paper |
Modelization of deterministic rational relations
Theoretical Computer Science | 2002-07-15 | Paper |
Kolmogorov complexity and non-determinism
Theoretical Computer Science | 2002-03-03 | Paper |
Syntactical truth predicates for second order arithmetic
The Journal of Symbolic Logic | 2002-01-22 | Paper |
La théorie élémentaire de la fonction de couplage de Cantor des entiers naturels est décidable
Comptes Rendus de l'Académie des Sciences - Series I - Mathematics | 2001-01-28 | Paper |
| scientific article; zbMATH DE number 1408334 (Why is no real title available?) | 2000-02-29 | Paper |
| scientific article; zbMATH DE number 5267 (Why is no real title available?) | 1992-06-25 | Paper |
Every recursive linear ordering has a copy in DTIME-SPACE(<i>n</i>,log(<i>n</i>))
Journal of Symbolic Logic | 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)
L'Enseignement Mathématique. 2e Série | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 3848632 (Why is no real title available?) | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3845574 (Why is no real title available?) | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3825787 (Why is no real title available?) | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3803425 (Why is no real title available?) | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3559581 (Why is no real title available?) | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3559581 (Why is no real title available?) | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3494409 (Why is no real title available?) | 1975-01-01 | Paper |
Intermediate submodels and generic extensions in set theory
Annals of Mathematics. Second Series | 1975-01-01 | Paper |
| scientific article; zbMATH DE number 3407657 (Why is no real title available?) | 1973-01-01 | Paper |
Combinatorics on ideals and forcing
Annals of Mathematical Logic | 1971-01-01 | Paper |
| scientific article; zbMATH DE number 3299713 (Why is no real title available?) | 1970-01-01 | Paper |
