Characterizations of complete residuated lattice-valued finite tree automata (Q1759726)
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 6109651
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Characterizations of complete residuated lattice-valued finite tree automata |
scientific article; zbMATH DE number 6109651 |
Statements
Characterizations of complete residuated lattice-valued finite tree automata (English)
0 references
22 November 2012
0 references
formal languages
0 references
tree automata
0 references
pumping lemma
0 references
\(L\)-valued regular tree languages
0 references
homomorphism
0 references
minimization algorithm
0 references
0 references
0 references
0 references
0 references
0.9039206504821776
0 references
0.8531355261802673
0 references
0.8506919741630554
0 references
0.8208774924278259
0 references
0.817115068435669
0 references
