Login / Signup
The complexity of computing the behaviour of lattice automata on infinite trees.
Karsten Lehmann
Rafael Peñaloza
Published in:
Theor. Comput. Sci. (2014)
Keyphrases
</>
cellular automata
tree automata
computational complexity
finite state
decision trees
decision problems
real time
data mining
machine learning
search algorithm
relational databases
tree structure
tree construction
boolean algebra