Regular Languages of Infinite Trees That Are Boolean Combinations of Open Sets (Q3167003): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-642-31585-5_13 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2160685099 / rank | |||
Normal rank | |||
Latest revision as of 18:49, 19 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
