Deciding the Borel Complexity of Regular Tree Languages (Q5175888)

From MaRDI portal
Revision as of 00:28, 20 April 2024 by Importer (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6408259
Language Label Description Also known as
English
Deciding the Borel Complexity of Regular Tree Languages
scientific article; zbMATH DE number 6408259

    Statements

    title
    Deciding the Borel Complexity of Regular Tree Languages (English)
    0 references
    author
    Alessandro Facchini
    0 references
    Henryk Michalewski
    0 references
    publication date
    25 February 2015
    0 references
    zbMATH DE Number
    6408259
    0 references
    OpenAlex ID
    W2964037520
    0 references
    arXiv ID
    1403.3502
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5175888&oldid=33725693"
    Powered by MediaWiki