Unambiguous tree languages are topologically harder than deterministic ones (Q4986520)
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: Unambiguous tree languages are topologically harder than deterministic ones |
scientific article; zbMATH DE number 7340153
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Unambiguous tree languages are topologically harder than deterministic ones |
scientific article; zbMATH DE number 7340153 |
Statements
27 April 2021
0 references
0.8165843486785889
0 references
0.8160324096679688
0 references
0.8050881624221802
0 references
0.7716867923736572
0 references
