39344
An example of recursive language that is not context-sensitive is any recursive language whose decision is an EXPSPACE-hard problem , say , the set of pairs of equivalent regular expressions with exponentiation .
 None
Given options, please tell me the categories of all the listed entity words.Output format is "type1: word1; type2: word2". 
Option: location, person, organization 
Text: {0} 
 Entities:  
Answer:
 None