Login / Signup
On the descriptional complexity of stateless deterministic ordered restarting automata.
Friedrich Otto
Kent Kwee
Published in:
Inf. Comput. (2018)
Keyphrases
</>
worst case
finite automata
database
finite state
complexity analysis
finite state automaton
neural network
information systems
database systems
relational databases
evolutionary algorithm
special case
cellular automata
space complexity
finite state machines
turing machine