We are improving our search experience. To check which content you have full access to, or for advanced search, go back to the old search.

Search

Please fill in this field.
Filters applied:
Computer science

Search Results

Showing 1-4 of 4 results

  1. On Pattern Density and Sliding Block Code Behavior for the Besicovitch and Weyl Pseudo-distances

    Initially proposed by Formenti et al. for bi-infinite sequences, the Besicovitch and Weyl pseudo-distances express the viewpoint of an observer...
    Silvio Capobianco in SOFSEM 2010: Theory and Practice of Computer Science
    Conference paper 2010

  2. Elementary cellular automaton Rule 110 explained as a block substitution system

    This paper presents the characterization of Rule 110 as a block substitution system of three symbols. Firstly, it is proved that the dynamics of Rule...

    Juan C. Seck-Tuoh-Mora, Genaro J. Martínez, ... Joselito Medina-Marín in Computing
    Article 10 June 2010

  3. Induced Subshifts and Cellular Automata

    Given a shift subspace over a finitely generated group, we define the subshift induced by it on a larger group. Then we do the same with cellular...
    Silvio Capobianco in Language and Automata Theory and Applications
    Conference paper 2008

  4. Systolic computation of interpolating polynomials

    Several time-optimal and spacetime-optimal systolic arrays are presented for computing a process dependence graph corresponding to the Aitken...

    P. R. Cappello, E. Gallopoulos, Ç. K. Koç in Computing
    Article 01 June 1990
Did you find what you were looking for? Share feedback.