All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 54 Next

Displaying 1061 – 1080 of 2186

Showing per page

Number-Conserving Reversible Cellular Automata and Their Computation-Universality

Kenichi Morita, Katsunobu Imai (2010)

RAIRO - Theoretical Informatics and Applications

We introduce a new model of cellular automaton called a one-dimensional number-conserving partitioned cellular automaton (NC-PCA). An NC-PCA is a system such that a state of a cell is represented by a triple of non-negative integers, and the total (i.e., sum) of integers over the configuration is conserved throughout its evolving (computing) process. It can be thought as a kind of modelization of the physical conservation law of mass (particles) or energy. We also define a reversible version...

O složitosti

Pavel Pudlák (1988)

Pokroky matematiky, fyziky a astronomie

Object oriented institutions to specify symbolic computation systems

César Domínguez, Laureano Lambán, Julio Rubio (2007)

RAIRO - Theoretical Informatics and Applications

The specification of the data structures used in EAT, a software system for symbolic computation in algebraic topology, is based on an operation that defines a link among different specification frameworks like hidden algebras and coalgebras. In this paper, this operation is extended using the notion of institution, giving rise to three institution encodings. These morphisms define a commutative diagram which shows three possible views of the same construction, placing it in an equational algebraic...

On a class of infinitary codes

Nguyen Huong Lâm, Do Long Van (1990)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

On a complete set of operations for factorizing codes

Clelia De Felice (2006)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

It is known that the class of factorizing codes, i.e., codes satisfying the factorization conjecture formulated by Schützenberger, is closed under two operations: the classical composition of codes and substitution of codes. A natural question which arises is whether a finite set 𝒪 of operations exists such that each factorizing code can be obtained by using the operations in 𝒪 and starting with prefix or suffix codes. 𝒪 is named here a complete set of operations (for factorizing codes). We show...

On a complete set of operations for factorizing codes

Clelia De Felice (2010)

RAIRO - Theoretical Informatics and Applications

It is known that the class of factorizing codes, i.e., codes satisfying the factorization conjecture formulated by Schützenberger, is closed under two operations: the classical composition of codes and substitution of codes. A natural question which arises is whether a finite set O of operations exists such that each factorizing code can be obtained by using the operations in O and starting with prefix or suffix codes. O is named here a complete set of operations (for factorizing codes). We show...

On a computational approach to multiple contacts / impacts of elastic bodies

Vala, Jiří, Rek, Václav (2023)

Programs and Algorithms of Numerical Mathematics

The analysis of dynamic contacts/impacts of several deformable bodies belongs to both theoretically and computationally complicated problems, because of the presence of unpleasant nonlinearities and of the need of effective contact detection. This paper sketches how such difficulties can be overcome, at least for a model problem with several elastic bodies, using i) the explicit time-discretization scheme and ii) the finite element technique adopted to contact evaluations together with iii) the...

Currently displaying 1061 – 1080 of 2186