Serge Grigorieff

Inf. Comput., 2022

2021

The algebra of binary trees is affine complete.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2021

2020

Congruence Preservation, Lattices and Recognizability.

[BibT_eX]

[DOI]

CoRR, 2020

2016

Characterizing Congruence Preserving Functions Z/nZ → Z/mZ Via Rational Polynomials.

[BibT_eX]

[DOI]

Integers, 2016

2015

Wadge hardness in Scott spaces and its effectivization.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2015

Borel and Hausdorff hierarchies in topological spaces of Choquet games and their effectivization.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2015

Logical Theory of the Monoid of Languages over a Non Tally Alphabet.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2015

Characterizing congruence preserving functions $Z/nZ\to Z/mZ$ via rational polynomials.

[BibT_eX]

[DOI]

CoRR, 2015

Monadic Theory of a Linear Order Versus the Theory of its Subsets with the Lifted Min/Max Operations.

[BibT_eX]

[DOI]

Proceedings of the Fields of Logic and Computation II, 2015

Arithmetical Congruence Preservation: From Finite to Infinite.

[BibT_eX]

[DOI]

Proceedings of the Fields of Logic and Computation II, 2015

2014

On lattices of regular sets of natural integers closed under decrementation.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2014

Integral Difference Ratio Functions on Integers.

[BibT_eX]

[DOI]

Proceedings of the Computing with New Resources, 2014

2013

Newton representation of functions over natural integers having integral difference ratios.

[BibT_eX]

[DOI]

CoRR, 2013

2012

Rational relations having a rational trace on each finite intersection of rational relations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Classes of Algorithms: Formalization and Comparison.

[BibT_eX]

[DOI]

Pierre Valarcher

Bull. EATCS, 2012

Functionals Using Bounded Information and the Dynamics of Algorithms.

[BibT_eX]

[DOI]

Pierre Valarcher

Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

2010

Kolmogorov Complexity in perspective. Part I: Information Theory and Randomnes

[BibT_eX]

[DOI]

CoRR, 2010

Evolving Multialgebras Unify All Usual Sequential Computation Models.

[BibT_eX]

[DOI]

Pierre Valarcher

Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

A Topological Approach to Recognition.

[BibT_eX]

[DOI]

Mai Gehrke

Jean-Eric Pin

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

ASMs and Operational Algorithmic Completeness of Lambda Calculus.

[BibT_eX]

[DOI]

Proceedings of the Fields of Logic and Computation, 2010

2009

The "equal last letter" predicate for words on infinite alphabets and classes of multitape automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Finite n-tape automata over possibly infinite alphabets: Extending a theorem of Eilenberg et al.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

From index sets to randomness in EMPTY SET n: random reals and possibly infinite computations. Part II.

[BibT_eX]

[DOI]

J. Symb. Log., 2009

2008

Kolmogorov complexity in perspective

[BibT_eX]

[DOI]

CoRR, 2008

Set theoretical Representations of Integers, I

[BibT_eX]

[DOI]

CoRR, 2008

Kolmogorov complexities Kmax, Kmin on computable partially ordered sets

[BibT_eX]

[DOI]

CoRR, 2008

Refinment of the "up to a constant" ordering using contructive co-immunity and alike. Application to the Min/Max hierarchy of Kolmogorov complexities

[BibT_eX]

[DOI]

CoRR, 2008

Church, Cardinal and Ordinal Representations of Integers and Kolmogorov complexity

[BibT_eX]

[DOI]

CoRR, 2008

Duality and Equational Theory of Regular Languages.

[BibT_eX]

[DOI]

Mai Gehrke

Jean-Eric Pin

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2007

Random reals à la Chaitin with or without prefix-freeness.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

2006

Synchronization of a bounded degree graph of cellular automata with nonuniform delays in time D floor(logm D).

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Kolmogorov complexities Kmax, Kmin on computable partially ordered sets.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Kolmogorov complexity and set theoretical representations of integers.

[BibT_eX]

[DOI]

Math. Log. Q., 2006

Randomness and halting probabilities.

[BibT_eX]

[DOI]

J. Symb. Log., 2006

Decision problems among the main subfamilies of rational relations.

[BibT_eX]

[DOI]

Olivier Carton

RAIRO Theor. Informatics Appl., 2006

Separability of rational relations in A* × Nm by recognizable relations is decidable.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2006

2005

Random reals and possibly infinite computations Part I: Randomness in ∅'.

[BibT_eX]

[DOI]

J. Symb. Log., 2005

2004

Recursion and topology on 2<=omega for possibly infinite computations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

[BibT_eX]

[DOI]

Maurice Margenstern

Fundam. Informaticae, 2004

2002

Kolmogorov complexity and non-determinism.

[BibT_eX]

[DOI]

Jean-Yves Marion

Theor. Comput. Sci., 2002

Modelization of deterministic rational relations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

2001

Syntactical Truth Predicates For Second Order Arithmetic.

[BibT_eX]

[DOI]

Loïc Colson

J. Symb. Log., 2001

Is Randomness "Native" to Computer Science?

[BibT_eX]

Bull. EATCS, 2001

2000

The Theory of Rational Relations on Transfinite Strings.

[BibT_eX]

Proceedings of the International Colloquium on Words, 2000

1999

Uniformization of Rational Relations.

[BibT_eX]

Proceedings of the Jewels are Forever, 1999

1990

Every Recursive Linear Ordering Has a Copy in DTIME-SPACE(n, log(n)).

[BibT_eX]

[DOI]