Tight Bounds for the Space Complexity of Nonregular Language Recognition by Real-Time Machines.
Abuzer YakaryilmazA. C. Cem SayPublished in: Int. J. Found. Comput. Sci. (2013)
Keyphrases
- space complexity
- tight bounds
- real time
- upper bound
- worst case
- object recognition
- automatic recognition
- recognition accuracy
- recognition rate
- feature extraction
- arc consistency
- language learning
- low cost
- pattern recognition
- worst case time complexity
- programming language
- visual recognition
- motion recognition
- recognition algorithm
- control system
- natural language
- hand postures
- recognition of facial expressions
- turing machine
- action recognition
- fine grained
- high speed
- state space