Varieties of tree languages definable by syntactic monoids
An algebraic characterization of the families of tree languages definable by syntactic monoids is presented. This settles a question raised by several authors.
Elmentve itt :
| Szerző: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
2005
|
| Sorozat: | Acta cybernetica
17 No. 1 |
| Kulcsszavak: | Számítástechnika, Kibernetika |
| Tárgyszavak: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12751 |
| Tartalmi kivonat: | An algebraic characterization of the families of tree languages definable by syntactic monoids is presented. This settles a question raised by several authors. |
|---|---|
| Terjedelem/Fizikai jellemzők: | 21-41 |
| ISSN: | 0324-721X |