NFAs with Tagged Transitions, their Conversion to Deterministic Automata and Application to Regular Expressions

Ville Laurikari

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

    32 Citations (Scopus)
    Original languageEnglish
    Title of host publication7th International Symposium on String Processing and Information Retrieval (SPIRE 2000), A Coruña, Spain, 27-29 September 2000
    EditorsF. Titsworth
    Place of PublicationLos Alamitos, CA
    PublisherIEEE Computer Society
    Pages181-187
    Publication statusPublished - 2000
    MoE publication typeA4 Article in a conference publication

    Keywords

    • regular expressions, submatch addressing, automata theory

    Cite this

    Laurikari, V. (2000). NFAs with Tagged Transitions, their Conversion to Deterministic Automata and Application to Regular Expressions. In F. Titsworth (Ed.), 7th International Symposium on String Processing and Information Retrieval (SPIRE 2000), A Coruña, Spain, 27-29 September 2000 (pp. 181-187). IEEE Computer Society.