State Complexity of Basic Operations on Suffix-Free Regular Languages

Abstract We investigate the state complexity of basic operations for suffix-free regular languages. The state complexity of an operation for regular languages is the number of states that are necessary and sufficient in the worst-case for the minimal deterministic finite-state automaton that accepts the language obtained from the operation. We establish the precise state complexity of catenation, Kleene star, reversal and the Boolean operations for suffix-free regular languages.

Authors

• Yo-Sub Han
• Kai Salomaa

Keywords

No keywords are indexed for this paper.