Reversibility in generalized Pascal triangles and binary reversibility in one-dimensional cellular automata

Ivan Korec

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

The search session has expired. Please query the service again.

Displaying similar documents to “Reversibility in generalized Pascal triangles and binary reversibility in one-dimensional cellular automata”

The $3 x + 1$ problem, generalized Pascal triangles and cellular automata

Ivan Korec (1992)

Mathematica Slovaca

Similarity:

$r$ -systems of unary algebras. II: Maximal and minimal subalgebras of the direct products of unary algebras

Imrich Abrhan, Ladislav Satko (1994)

Mathematica Slovaca

Similarity:

Characterizing binary discriminator algebras

Ivan Chajda (2000)

Mathematica Bohemica

Similarity:

The concept of the (dual) binary discriminator was introduced by R. Halas, I. G. Rosenberg and the author in 1999. We study finite algebras having the (dual) discriminator as a term function. In particular, a simple characterization is obtained for such algebras with a majority term function.

Displaying similar documents to “Reversibility in generalized Pascal triangles and binary reversibility in one-dimensional cellular automata”

The 3 x + 1 problem, generalized Pascal triangles and cellular automata

r -systems of unary algebras. II: Maximal and minimal subalgebras of the direct products of unary algebras

Characterizing binary discriminator algebras

The $3 x + 1$ problem, generalized Pascal triangles and cellular automata

$r$ -systems of unary algebras. II: Maximal and minimal subalgebras of the direct products of unary algebras