Piecewise testable tree languages (Q3166216)

From MaRDI portal
Revision as of 10:33, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Piecewise testable tree languages
scientific article

    Statements

    title
    Piecewise testable tree languages (English)
    0 references
    author
    Mikołaj Bojańczyk
    0 references
    Luc Segoufin
    0 references
    Howard Straubing
    0 references
    publication date
    22 October 2012
    0 references
    zbMATH Keywords
    first-order logic on trees
    0 references
    definability
    0 references
    decidability
    0 references
    unranked trees
    0 references
    tree languages
    0 references
    piecewise testability
    0 references
    syntactic algebras
    0 references

    Identifiers

    Mathematics Subject Classification ID
    03D05
    0 references
    03B70
    0 references
    68Q45
    0 references
    68Q70
    0 references
    zbMATH DE Number
    6096731
    0 references
    arXiv ID
    1208.5129
    0 references
    OpenAlex ID
    W1965525337
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3166216&oldid=37302043"
    Powered by MediaWiki