Complexity of universality and related problems for partially ordered NFAs.
Markus KrötzschTomás MasopustMichaël ThomazoPublished in: Inf. Comput. (2017)
Keyphrases
- related problems
- partially ordered
- partial order
- stable marriage
- partial ordering
- totally ordered
- broadly applicable
- event calculus
- interval valued
- range searching
- space complexity
- possibilistic logic
- total order
- regular expressions
- computational complexity
- cellular automata
- worst case
- pattern matching
- data mining
- total ordering