On the Computational Complexity of the Freezing Non-strict Majority Automata.
Eric GolesDiego MaldonadoPedro MontealegreNicolas OllingerPublished in: AUTOMATA (2017)
Keyphrases
- computational complexity
- cellular automata
- np complete
- low complexity
- high computational complexity
- np hard
- special case
- finite automata
- finite state machines
- regular expressions
- memory requirements
- decision problems
- formal language theory
- computationally efficient
- motion estimation
- lower bound
- information retrieval
- computational efficiency
- bit rate
- finite state
- multiscale
- tree automata
- probabilistic automata
- linear computational complexity
- lattice gas
- machine learning