Tight Bounds for the State Complexity of Deterministic Cover Automata.

Cezar Câmpeanu Andrei Paun Jason R. Smith

Published in: DCFS (2006)

Keyphrases

tight bounds
finite state automaton
upper bound
cellular automata
social networks
finite state machines
state space
hidden markov models
complexity analysis
space complexity
memory requirements
neural network
search space
case study
image processing
computer vision
search engine
artificial intelligence
real world