Beyond regularity: Equational tree automata for associative and commutative theories (Q4783330)
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 1841842
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Beyond regularity: Equational tree automata for associative and commutative theories |
scientific article; zbMATH DE number 1841842 |
Statements
4 December 2002
0 references
equational theory
0 references
decidability
0 references
equational tree automata
0 references
recognizable tree languages
0 references
linear bounded automata
0 references
0.8789085745811462
0 references
0.8613619208335876
0 references
0.8252207040786743
0 references
0.8238757848739624
0 references
0.8200232982635498
0 references
Beyond regularity: Equational tree automata for associative and commutative theories (English)
0 references