We study the NFA reductions by invariant equivalences and preorders. It is well-known that the NFA minimization problem is PSPACE-complete. Therefore, there have been many approaches to reduce the size of NFAs in low polynomial time by computing invariant equivalence or preorder relation and merging the states within same equivalence class. Here we consider the nondeterminism reduction of NFAs by invariant equivalences and preorders. We, in particular, show that computing equivalence and preorder relation from the left is more useful than the right for reducing the degree of nondeterminism in NFAs. We also present experimental evidence for showing that NFA reduction from the left achieves the better reduction of nondeterminism than reduction from the right.
|Number of pages||20|
|Journal||International Journal of Foundations of Computer Science|
|Publication status||Published - 2021 Aug|
Bibliographical noteFunding Information:
This research was supported by the NRF grant funded by MIST (NRF-2020R1A4A3079947).
© 2021 World Scientific Publishing Co. Pte Ltd. All rights reserved.
All Science Journal Classification (ASJC) codes
- Computer Science (miscellaneous)