## References

SHOWING 1-10 OF 39 REFERENCES

Positive expansiveness versus network dimension in symbolic dynamical systems

- MathematicsTheor. Comput. Sci.
- 2011

Cellular Graph Automata. I. Basic Concepts, Graph Property Measurement, Closure Properties

- Computer ScienceInf. Control.
- 1979

On the influence of the interaction graph on a finite dynamical system

- Mathematics, Computer ScienceNatural Computing
- 2019

It is shown that the minimum rank decreases with the alphabet size, thus yielding the definition of an absolute minimum rank, and lower and upper bounds on thisabsolute minimum rank are obtained.

Cellular Graph Automata. II. Graph and Subgraph Isomorphism, Graph Structure Recognition

- Mathematics, Computer ScienceInf. Control.
- 1979

Cellular Graph Automata

- Computer ScienceGraph-Grammars and Their Application to Computer Science and Biology
- 1978

It can be shown that a cellular d-graph automaton can measure various properties of its underlying graph; can detect graph or subgraph isomorphism; and can recognize various basic types of graphs.

On Dynamical Complexity of Surjective Ultimately Right-Expansive Cellular Automata

- MathematicsAutomata
- 2018

It is shown that there exists a right-expansive reversible cellular automaton that has a non-sofic trace and thus does not have the pseudo-orbit tracing property.

Graph-Theoretical Constructions for Graph Entropy and Network Coding Based Communications

- Computer ScienceIEEE Transactions on Information Theory
- 2011

An undirected graph on all possible configurations of the digraph, referred to as the guessing graph, is introduced, which encapsulates the essence of dependence amongst configurations and proves that the guessing number of a digraph is equal to the logarithm of the independence number of its guessing graph.

Word problems requiring exponential time(Preliminary Report)

- Computer Science, MathematicsSTOC
- 1973

A number of similar decidable word problems from automata theory and logic whose inherent computational complexity can be precisely characterized in terms of time or space requirements on deterministic or nondeterministic Turing machines are considered.