TREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS (Q4626611)
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 7030815
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | TREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS |
scientific article; zbMATH DE number 7030815 |
Statements
28 February 2019
0 references
tree automata
0 references
lattice-valued logic
0 references
reduction algorithm
0 references
decision problem
0 references
time complexity
0 references
TREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS (English)
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9285559
0 references
0 references
0.9164243
0 references
0.9091318
0 references
0.9020967
0 references
0 references
0.9001204
0 references
0.8954705
0 references
