On the Complexity of Semantic Equivalences for Pushdown Automata and BPA.
Antonín KuceraRichard MayrPublished in: MFCS (2002)
Keyphrases
- natural language
- computational complexity
- semantic annotation
- high level
- cellular automata
- semantic analysis
- finite state
- semantic features
- semantic relationships
- semantic level
- domain specific
- domain independent
- decision problems
- connected components
- worst case
- semantic network
- regular expressions
- semantically rich