The satisfiability of word equations: decidable and undecidable theories (Q1798903)

From MaRDI portal
Revision as of 00:56, 20 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
The satisfiability of word equations: decidable and undecidable theories
scientific article

    Statements

    title
    The satisfiability of word equations: decidable and undecidable theories (English)
    0 references
    author
    Joel D. Day
    0 references
    Vijay Ganesh
    0 references
    Paul He
    0 references
    Florin Manea
    0 references
    Dirk Nowotka
    0 references
    publication date
    23 October 2018
    0 references
    zbMATH Keywords
    word equations
    0 references
    decidability
    0 references
    satisfiability
    0 references
    describes a project that uses
    Stranger
    0 references
    Norn
    0 references
    Z3str3
    0 references
    Z3str2
    0 references
    HAMPI
    0 references
    CVC4
    0 references

    Identifiers

    zbMATH DE Number
    6963047
    0 references
    OpenAlex ID
    W2889237106
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1798903&oldid=32690235"
    Powered by MediaWiki