Descriptional Complexity of Deterministic Restarting Automata.

Markus Holzer Martin Kutrib Jens Reimann

Published in: DCFS (2005)

Keyphrases

cellular automata
computer vision
space complexity
social networks
computational complexity
worst case
turing machine
finite state automaton
real time
genetic algorithm
video sequences
lower bound
evolutionary algorithm
mobile robot
regular expressions
finite state