Regular Languages of Infinite Trees That Are Boolean Combinations of Open Sets (Q3167003): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 10:00, 5 March 2024
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
