Classes of tree languages and DR tree languages given by classes of semigroups
In the first section of the paper we give general conditions under which a class of recognizable tree languages with a given property can be defined by a class of monoids or semigroups defining the class of string languages having the same property. In the second part similar questions are studied f...
Elmentve itt :
| Szerző: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
2011
|
| Sorozat: | Acta cybernetica
20 No. 2 |
| Kulcsszavak: | Számítástechnika, Kibernetika |
| Tárgyszavak: | |
| doi: | 10.14232/actacyb.20.2.2011.3 |
| Online Access: | http://acta.bibl.u-szeged.hu/12910 |