In Section 8, we show that the upper bounds on the quotient complexity of reversal of prefix-, suffix-, bifix-, and factor-free regular languages can be met by ...
確定! 回上一頁