Categories of partial morphisms and the relation between type structures. Partial variations on a theme of Friedman and Statman
Category of extended fuzzy automata
Category-theoretic models of linear Abadi & Plotkin logic.
Cayley's Theorem
The article formalizes the Cayley's theorem saying that every group G is isomorphic to a subgroup of the symmetric group on G.
CD-systems of stateless deterministic R(1)-automata governed by an external pushdown store
We study cooperating distributed systems (CD-systems) of stateless deterministic restarting automata with window size 1 that are equipped with an external pushdown store. In this way we obtain an automata-theoretical characterization for the class of word languages that are linearizations of context-free trace languages.
CD-systems of stateless deterministic R(1)-automata governed by an external pushdown store⋆⋆⋆
We study cooperating distributed systems (CD-systems) of stateless deterministic restarting automata with window size 1 that are equipped with an external pushdown store. In this way we obtain an automata-theoretical characterization for the class of word languages that are linearizations of context-free trace languages.
CEDRICS: When CEDRAM Meets Tralics
We describe CEDRICS, a general purpose system for automated journal production entirely based on a LaTeX input format. We show how the very basic ideas that initiated the whole effort turned into an efficient system because of the ability of LaTeX markup to parametrise simultaneously and without compromise high typographical quality for the PDF output as well as accurate XML metadata with (presentation) MathML formulas. This was made possible by the availability of two entirely independent LaTeX...
Census algorithms for chinese remainder pseudorank
We investigate the density and distribution behaviors of the chinese remainder representation pseudorank. We give a very strong approximation to density, and derive two efficient algorithms to carry out an exact count (census) of the bad pseudorank integers. One of these algorithms has been implemented, giving results in excellent agreement with our density analysis out to -bit integers.
Census algorithms for chinese remainder pseudorank
We investigate the density and distribution behaviors of the chinese remainder representation pseudorank. We give a very strong approximation to density, and derive two efficient algorithms to carry out an exact count (census) of the bad pseudorank integers. One of these algorithms has been implemented, giving results in excellent agreement with our density analysis out to 5189-bit integers.
Certificates of factorisation for a class of triangle-free graphs.
Certificates of factorisation for chromatic polynomials.
Chaines maximales de préordres.
Challenging complexity of maximum common subgraph detection algorithms: A performance analysis of three algorithms on a wide database of graphs.
Champs de Markov cachés flous et segmentation d'images
Chance constrained bottleneck transportation problem with preference of routes
This paper considers a variant of the bottleneck transportation problem. For each supply-demand point pair, the transportation time is an independent random variable. Preference of each route is attached. Our model has two criteria, namely: minimize the transportation time target subject to a chance constraint and maximize the minimal preference among the used routes. Since usually a transportation pattern optimizing two objectives simultaneously does not exist, we define non-domination in this...
Chaos and complexity in a simple model of production dynamics.
Chaos and geometric order in architecture and design.
Chaotic image encryption design using Tompkins-Paige algorithm.
Chaotic time series analysis.
Characterisations of ideal threshold schemes.