The support of a recognizable series over a zero-sum free, commutative semiring is recognizable
We show that the support of a recognizable series over a zero-sum free, commutative semiring is a recognizable language. We also give a sufficient and necessary condition for the existence of an effective transformation of a weighted automaton recognizing a series S over a zero-sum free, commutative...
Elmentve itt :
| Szerző: | |
|---|---|
| Testületi 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.1 |
| Online Access: | http://acta.bibl.u-szeged.hu/12908 |
| LEADER | 01256nab a2200241 i 4500 | ||
|---|---|---|---|
| 001 | acta12908 | ||
| 005 | 20220617134740.0 | ||
| 008 | 161015s2011 hu o 0|| eng d | ||
| 022 | |a 0324-721X | ||
| 024 | 7 | |a 10.14232/actacyb.20.2.2011.1 |2 doi | |
| 040 | |a SZTE Egyetemi Kiadványok Repozitórium |b hun | ||
| 041 | |a eng | ||
| 100 | 1 | |a Kirsten Daniel | |
| 245 | 1 | 4 | |a The support of a recognizable series over a zero-sum free, commutative semiring is recognizable |h [elektronikus dokumentum] / |c Kirsten Daniel |
| 260 | |c 2011 | ||
| 300 | |a 211-221 | ||
| 490 | 0 | |a Acta cybernetica |v 20 No. 2 | |
| 520 | 3 | |a We show that the support of a recognizable series over a zero-sum free, commutative semiring is a recognizable language. We also give a sufficient and necessary condition for the existence of an effective transformation of a weighted automaton recognizing a series S over a zero-sum free, commutative semiring into an automaton recognizing the support of S. | |
| 650 | 4 | |a Természettudományok | |
| 650 | 4 | |a Számítás- és információtudomány | |
| 695 | |a Számítástechnika, Kibernetika | ||
| 710 | |a Weighted Automata : Theory and Applications (2010) (Leipzig) | ||
| 856 | 4 | 0 | |u http://acta.bibl.u-szeged.hu/12908/1/actacyb_20_2_2011_1.pdf |z Dokumentum-elérés |