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 this page instead for the normal view: Characterizations of complete residuated lattice-valued finite tree automata |
scientific article; zbMATH DE number 6109651
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
