Computational Complexity of Certain Problems Related to Carefully Synchronizing Words for Partial Automata and Directing Words for Nondeterministic Automata.
Pavel MartyuginPublished in: Theory Comput. Syst. (2014)
Keyphrases
- computational complexity
- np complete
- finite automata
- finite state
- n gram
- decision problems
- english words
- special case
- optimization problems
- cellular automata
- text documents
- word sense disambiguation
- probabilistic automata
- related words
- semantically related
- word segmentation
- objective function
- finite state machines
- tree automata
- natural language
- genetic algorithm