contrast to FPFs and deterministic Biichi automata, simple prefix formulas are closed under boolean operations. This is important for the translation.
確定! 回上一頁