Connecting you to content on EBSCOhost

Works matching IS 00255661 AND DT 1996 AND VI 29 AND IP 1

Results: 6

1

Upper Bounds for the Complexity of Sparse and Tally Descriptions.

Published in:

Mathematical Systems Theory, 1996, v. 29, n. 1, p. 63, doi. 10.1007/BF01201814

By:

Arvind, V.;
Köbler, J.;
Mundhenk, M.

Publication type:

Article

2

Representation of Reversible Cellular Automata with Block Permutations.

Published in:

Mathematical Systems Theory, 1996, v. 29, n. 1, p. 47, doi. 10.1007/BF01201813

By:

Kari, J.

Publication type:

Article

3

On the Power of Generalized MOD-Classes.

Published in:

Mathematical Systems Theory, 1996, v. 29, n. 1, p. 33

By:

Köhler, J.;
Toda, Seinosuke

Publication type:

Article

4

Probabilistic Asynchronous Automata.

Published in:

Mathematical Systems Theory, 1996, v. 29, n. 1, p. 5, doi. 10.1007/BF01201811

By:

Jesi, S.;
Pighizzini, G.;
Sabadini, N.

Publication type:

Article

5

Experimental Studies of Algorithms.

Published in:

Mathematical Systems Theory, 1996, v. 29, n. 1, p. 3, doi. 10.1007/BF01201810

By:

McGeoch, Catherine C.

Publication type:

Article

6

Editorial.

Published in:

1996

By:

Rosenberg, Arnold L.

Publication type:

Editorial