On the Size Complexity of Deterministic Frequency Automata.
Rusins FreivaldsThomas ZeugmannGrant R. PogosyanPublished in: LATA (2013)
Keyphrases
- space complexity
- network size
- computational complexity
- memory requirements
- turing machine
- worst case
- finite state automaton
- black box
- neural network
- data sets
- real time
- bayesian networks
- data model
- computational cost
- case study
- cellular automata
- feature selection
- temporal logic
- finite automata
- databases
- exponential size