A pumping lemma and decidability problems for recognizable tree series
In the present paper we show that given a tree series S, which is accepted by (a) a deterministic bottom-up finite state weighted tree automaton (for short: bu-w-fta) or (b) a non-deterministic bu-w-fta over a locally finite semiring, there exists for every input tree t E supp(S) a decomposition t =...
Elmentve itt :
| Szerző: | |
|---|---|
| Testületi szerző: | |
| Dokumentumtípus: | Cikk |
| Megjelent: |
2004
|
| Sorozat: | Acta cybernetica
16 No. 4 |
| Kulcsszavak: | Számítástechnika, Nyelvészet - számítógép alkalmazása |
| Tárgyszavak: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12739 |
| LEADER | 01989nab a2200229 i 4500 | ||
|---|---|---|---|
| 001 | acta12739 | ||
| 005 | 20220615095149.0 | ||
| 008 | 161015s2004 hu o 0|| eng d | ||
| 022 | |a 0324-721X | ||
| 040 | |a SZTE Egyetemi Kiadványok Repozitórium |b hun | ||
| 041 | |a eng | ||
| 100 | 1 | |a Borchardt Björn | |
| 245 | 1 | 2 | |a A pumping lemma and decidability problems for recognizable tree series |h [elektronikus dokumentum] / |c Borchardt Björn |
| 260 | |c 2004 | ||
| 300 | |a 509-544 | ||
| 490 | 0 | |a Acta cybernetica |v 16 No. 4 | |
| 520 | 3 | |a In the present paper we show that given a tree series S, which is accepted by (a) a deterministic bottom-up finite state weighted tree automaton (for short: bu-w-fta) or (b) a non-deterministic bu-w-fta over a locally finite semiring, there exists for every input tree t E supp(S) a decomposition t = C'[C[s]] into contexts C, C' and an input tree s as well as there exist semiring elements a, a', b, b', c such that the equation (S,C'[Cn[s]]) = a'OanOcObnOb' holds for every non-negative integer n. In order to prove this pumping lemma we extend the power-set construction of classical theories and show that for every non-deterministic bu-w-fta over a locally finite semiring there exists an equivalent deterministic one. By applying the pumping lemma we prove the decidability of a tree series S being constant on its support, S being constant, S being boolean, the support of S being the empty set, and the support of S being a finite set provided that S is accepted by (a) a deterministic bu-w-fta over a commutative semiring or (b) a non-deterministic bu-w-fta over a locally finite commutative semiring. | |
| 650 | 4 | |a Természettudományok | |
| 650 | 4 | |a Számítás- és információtudomány | |
| 695 | |a Számítástechnika, Nyelvészet - számítógép alkalmazása | ||
| 710 | |a Conference on Hungarian Computational Linguistics (1.) (2003) (Szeged) | ||
| 856 | 4 | 0 | |u http://acta.bibl.u-szeged.hu/12739/1/Borchardt_2004_ActaCybernetica.pdf |z Dokumentum-elérés |