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

From MaRDI portal
Revision as of 10:00, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Regular Languages of Infinite Trees That Are Boolean Combinations of Open Sets
scientific article

    Statements

    Regular Languages of Infinite Trees That Are Boolean Combinations of Open Sets (English)
    0 references
    0 references
    0 references
    1 November 2012
    0 references

    Identifiers