Deciding piecewise testable separability for regular tree languages (Q4598238)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6820286
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Deciding piecewise testable separability for regular tree languages |
scientific article; zbMATH DE number 6820286 |
Statements
19 December 2017
0 references
well-quasiorder
0 references
ideal
0 references
tree languages
0 references
first-order logic
0 references
Deciding Piecewise Testable Separability for Regular Tree Languages (English)
0 references
0.8457736372947693
0 references
0.8387807607650757
0 references
0.8361613750457764
0 references
0.8261864185333252
0 references
0.8033856749534607
0 references
