On the state complexity of closures and interiors of regular languages with subwords and superwords

    Theor. Comput. Sci., pp. 91-107, 2016.

    Cited by: 16|Bibtex|Views22|Links
    EI

    Abstract:

    The downward and upward closures of a regular language $L$ are obtained by collecting all the subwords and superwords of its elements, respectively. The downward and upward interiors of $L$ are obtained dually by collecting words having all their subwords and superwords in $L$, respectively. We provide lower and upper bounds on the size...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments