Crisp-Determinization of Weighted Tree Automata over Additively Locally Finite and Past-Finite Monotonic Strong Bimonoids Is Decidable
Elmentve itt :
| Szerzők: | |
|---|---|
| Dokumentumtípus: | Könyv része |
| Megjelent: |
Springer International Publishing
Cham
2020
|
| Sorozat: | Lecture Notes in Computer Science
Descriptional Complexity of Formal Systems: 22nd International Conference, DCFS 2020 |
| Tárgyszavak: | |
| doi: | 10.1007/978-3-030-62536-8_4 |
| mtmt: | 31669354 |
| Online Access: | http://publicatio.bibl.u-szeged.hu/36191 |
| LEADER | 01066naa a2200265 i 4500 | ||
|---|---|---|---|
| 001 | publ36191 | ||
| 005 | 20250304110905.0 | ||
| 008 | 250304s2020 hu o 000 eng d | ||
| 020 | |a 9783030625368; 9783030625351 | ||
| 024 | 7 | |a 10.1007/978-3-030-62536-8_4 |2 doi | |
| 024 | 7 | |a 31669354 |2 mtmt | |
| 040 | |a SZTE Publicatio Repozitórium |b hun | ||
| 041 | |a eng | ||
| 100 | 1 | |a Droste Manfred | |
| 245 | 1 | 0 | |a Crisp-Determinization of Weighted Tree Automata over Additively Locally Finite and Past-Finite Monotonic Strong Bimonoids Is Decidable |h [elektronikus dokumentum] / |c Droste Manfred |
| 260 | |a Springer International Publishing |b Cham |c 2020 | ||
| 300 | |a 13 | ||
| 300 | |a 39-51 | ||
| 490 | 0 | |a Lecture Notes in Computer Science | |
| 490 | 0 | |a Descriptional Complexity of Formal Systems: 22nd International Conference, DCFS 2020 | |
| 650 | 4 | |a Számítás- és információtudomány | |
| 700 | 0 | 1 | |a Fülöp Zoltán |e aut |
| 700 | 0 | 1 | |a Kószó Dávid |e aut |
| 700 | 0 | 1 | |a Vogler Heiko |e aut |
| 856 | 4 | 0 | |u http://publicatio.bibl.u-szeged.hu/36191/1/final-dcfs.pdf |z Dokumentum-elérés |