Patrick Cégielski

Available identifiers

zbMath Open cegielski.patrickMaRDI QIDQ1401348

List of research outcomes

Publication	Date of Publication	Type
Affine Completeness of Some Free Binary Algebras	2022-10-07	Paper
The algebra of binary trees is affine complete	2022-01-27	Paper
Affine completeness of some free binary algebras	2021-06-24	Paper
Affine completeness of the algebra of full binary trees	2021-01-14	Paper
The algebra of complete binary trees is affine complete	2020-05-18	Paper
Study of stepwise simulation between ASM	2020-05-12	Paper
Congruence preserving functions on free monoids	2017-12-21	Paper
Characterizing congruence preserving functions \(\mathbb Z/n\mathbb Z \to \mathbb Z/m\mathbb Z\) via rational polynomials	2016-10-28	Paper
Newton representation of functions over natural integers having integral difference ratios	2015-11-17	Paper
Arithmetical Congruence Preservation: From Finite to Infinite	2015-09-22	Paper
Integral Difference Ratio Functions on Integers	2015-09-08	Paper
On lattices of regular sets of natural integers closed under decrementation	2014-04-15	Paper
https://portal.mardi4nfdi.de/entity/Q3172121	2011-10-05	Paper
Normalization of Some Extended Abstract State Machines	2010-09-03	Paper
Multiple serial episodes matching	2010-01-18	Paper
Nonmaximal decidable structures	2010-01-15	Paper
Tree inclusions in windows and slices	2010-01-15	Paper
Destinies and decidability	2008-08-18	Paper
Tree inclusion problems	2008-07-21	Paper
Weakly maximal decidable structures	2008-07-21	Paper
https://portal.mardi4nfdi.de/entity/Q5445159	2008-03-03	Paper
Window Subsequence Problems for Compressed Texts	2007-05-02	Paper
On the amplitude of intervals of natural numbers whose every element has a common prime divisor with at least an extremity.	2003-08-17	Paper
Window-accumulated subsequence matching problem is linear	2002-11-27	Paper
Decidability of the theory of the natural integers with the Cantor pairing function and the successor	2001-08-20	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/Q4501633	2000-11-07	Paper
On arithmetical first-order theories allowing encoding and decoding of lists	2000-01-12	Paper
Definability, decidability, complexity	1997-07-01	Paper
Definability and decidability issues in extensions of the integers with the divisibility predicate	1996-11-24	Paper
https://portal.mardi4nfdi.de/entity/Q4697160	1993-06-29	Paper
https://portal.mardi4nfdi.de/entity/Q5750978	1990-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3480176	1990-01-01	Paper
The elementary theory of the natural lattice is finitely axiomatizable	1989-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3707987	1984-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3043148	1982-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3934367	1981-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3929714	1981-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3874170	1980-01-01	Paper

Research outcomes over time

This page was built for person: Patrick Cégielski