Regular Languages of Infinite Trees That Are Boolean Combinations of Open Sets (Q3167003)
From MaRDI portal
![]() | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Regular Languages of Infinite Trees That Are Boolean Combinations of Open Sets |
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
1 November 2012
0 references