Patrick Cégielski

Fundam. Informaticae, 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

2019

Study of Stepwise Simulation Between ASM.

[BibT_eX]

[DOI]

Julien Cervelle

Proceedings of the Computing with Foresight and Industry, 2019

2016

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

[BibT_eX]

[DOI]

Integers, 2016

2015

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

[BibT_eX]

[DOI]

CoRR, 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

2010

Normalization of Some Extended Abstract State Machines.

[BibT_eX]

[DOI]

Proceedings of the Fields of Logic and Computation, 2010

2008

Tree inclusion problems.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2008

Weakly maximal decidable structures.

[BibT_eX]

[DOI]

Alexis Bès

RAIRO Theor. Informatics Appl., 2008

2007

On the Additive Theory of Prime Numbers.

[BibT_eX]

[DOI]

Maxim Vsemirnov

Fundam. Informaticae, 2007

2006

Preface.

[BibT_eX]

[DOI]

Ruy J. G. B. de Queiroz

Theor. Comput. Sci., 2006

Multiple serial episodes matching.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2006

Multiple serial episode matching

[BibT_eX]

[DOI]

CoRR, 2006

Window Subsequence Problems for Compressed Texts.

[BibT_eX]

[DOI]

Proceedings of the Computer Science, 2006

2004

Foreword.

[BibT_eX]

[DOI]

Malika More

Theor. Comput. Sci., 2004

2003

On the amplitude of intervals of natural numbers whose every element has a common prime divisor with at least an extremity.

[BibT_eX]

[DOI]

François Heroult

Theor. Comput. Sci., 2003

2001

Decidability of the theory of the natural integers with the cantor pairing function and the successor.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

Window-accumulated subsequence matching problem is linear.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2001

1999

On Arithmetical First-Order Theories Allowing Encoding and Decoding of Lists.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1999

1997

Preface - Logic Colloquium '94, 21-30 July 1994, Clermont-Ferrand, France.

[BibT_eX]

Ann. Pure Appl. Log., 1997

1996

Definability and Decidability Issues in Extensions of the Integers with the Divisibility Predicate.

[BibT_eX]

[DOI]

J. Symb. Log., 1996

Definability, Decidability, Complexity.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 1996

1989

The Elementary Theory of the Natural Lattice Is Finitely Axiomatizable.

[BibT_eX]

[DOI]