The current implementation of the intersection algorithm on automata appears to be slow when dealing with very complex automata. In some cases, the determinization algorithm, which has exponential complexity, performs faster on the same type of automaton than the intersection algorithm, which has quadratic complexity.
Possible actions:
- Investigate and optimize the current implementation
- Minimize the number of OS calls within loops
- Consider rethinking the algorithm for improved performance
The current implementation of the intersection algorithm on automata appears to be slow when dealing with very complex automata. In some cases, the determinization algorithm, which has exponential complexity, performs faster on the same type of automaton than the intersection algorithm, which has quadratic complexity.
Possible actions: