On nondeterministic unranked tree automata with sibling constraints (Q2920139)
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: On nondeterministic unranked tree automata with sibling constraints |
scientific article; zbMATH DE number 6098237
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On nondeterministic unranked tree automata with sibling constraints |
scientific article; zbMATH DE number 6098237 |
Statements
24 October 2012
0 references
unranked tree automata
0 references
equality and disequality constraints
0 references
monadic second-order logic
0 references
On nondeterministic unranked tree automata with sibling constraints (English)
0 references
0.9321542978286744
0 references
0.8308680057525635
0 references
0.8186820149421692
0 references
0.8124571442604065
0 references
0.8124123811721802
0 references
