Regular Languages of Infinite Trees That Are Boolean Combinations of Open Sets (Q3167003)

From MaRDI portal
Revision as of 18:49, 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
Regular Languages of Infinite Trees That Are Boolean Combinations of Open Sets
scientific article

    Statements

    title
    Regular Languages of Infinite Trees That Are Boolean Combinations of Open Sets (English)
    0 references
    author
    Mikołaj Bojańczyk
    0 references
    Thomas Place
    0 references
    publication date
    1 November 2012
    0 references

    Identifiers

    zbMATH DE Number
    6101138
    0 references
    OpenAlex ID
    W2160685099
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3167003&oldid=31403569"
    Powered by MediaWiki