Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
IT IS NL-COMPLETE TO DECIDE WHETHER A HAIRPIN COMPLETION OF REGULAR LANGUAGES IS REGULAR - MaRDI portal

IT IS NL-COMPLETE TO DECIDE WHETHER A HAIRPIN COMPLETION OF REGULAR LANGUAGES IS REGULAR (Q3224950)

From MaRDI portal
scientific article
Language Label Description Also known as
English
IT IS NL-COMPLETE TO DECIDE WHETHER A HAIRPIN COMPLETION OF REGULAR LANGUAGES IS REGULAR
scientific article

    Statements

    title
    IT IS NL-COMPLETE TO DECIDE WHETHER A HAIRPIN COMPLETION OF REGULAR LANGUAGES IS REGULAR (English)
    0 references
    author
    Volker Diekert
    0 references
    Steffen Kopecki
    0 references
    publication date
    13 March 2012
    0 references
    zbMATH Keywords
    automata
    0 references
    formal languages
    0 references
    regular languages
    0 references
    finite automata
    0 references
    NL-complete problems
    0 references
    DNA-computing
    0 references
    hairpin completion
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q17
    0 references
    68Q45
    0 references
    68Q10
    0 references
    zbMATH DE Number
    6013985
    0 references
    OpenAlex ID
    W2963981206
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3224950&oldid=37112679"
    Powered by MediaWiki