Complexity in Union-Free Regular Languages (Q3584898)

From MaRDI portal
Revision as of 20:37, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Complexity in Union-Free Regular Languages
scientific article

    Statements

    title
    Complexity in Union-Free Regular Languages (English)
    0 references
    author
    Galina Jirásková
    0 references
    Tomáš Masopust
    0 references
    publication date
    31 August 2010
    0 references
    zbMATH Keywords
    regular expressions
    0 references
    deterministic union-free languages as languages
    0 references
    one-cycle-free-path deterministic finite automata
    0 references

    Identifiers

    zbMATH DE Number
    5776428
    0 references
    OpenAlex ID
    W2165473220
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3584898&oldid=31795346"
    Powered by MediaWiki