Synchronizing deterministic push-down automata can be really hard (Q6186317)

From MaRDI portal
Revision as of 19:16, 30 December 2024 by Import241228121245 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7798816
Language Label Description Also known as
English
Synchronizing deterministic push-down automata can be really hard
scientific article; zbMATH DE number 7798816

    Statements

    title
    Synchronizing deterministic push-down automata can be really hard (English)
    0 references
    author
    Henning Fernau
    0 references
    Petra Wolf
    0 references
    Tomoyuki Yamakami
    0 references
    publication date
    2 February 2024
    0 references
    zbMATH Keywords
    synchronization
    0 references
    complexity
    0 references
    deterministic push-down automata
    0 references
    cites work
    Q5208363
    0 references
    Q5551185
    0 references
    Q5208364
    0 references
    Q3304155
    0 references
    Q3890112
    0 references
    Q5089200
    0 references
    Q6134262
    0 references
    Q3859267
    0 references
    Q5576254
    0 references

    Identifiers

    zbMATH DE Number
    7798816
    0 references
    OpenAlex ID
    W3021478446
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q6186317&oldid=39751172"
    Powered by MediaWiki