Complexity of Universality and Related Problems for Partially Ordered NFAs.
Markus KrötzschTomás MasopustMichaël ThomazoPublished in: CoRR (2016)
Keyphrases
- related problems
- partially ordered
- partial order
- event calculus
- stable marriage
- partial ordering
- totally ordered
- total order
- range searching
- broadly applicable
- cellular automata
- decision problems
- space complexity
- interval valued
- computational complexity
- regular expressions
- pattern matching
- possibilistic logic
- worst case
- data streams