Equivalences between Ranked and Unranked Weighted Tree Automata via Binarization

Toni Dietze


Anthology ID:
W16-2401
Volume:
Proceedings of the SIGFSM Workshop on Statistical NLP and Weighted Automata
Month:
August
Year:
2016
Address:
Berlin, Germany
Editors:
Bryan Jurish, Andreas Maletti, Kay-Michael Würzner, Uwe Springmann
Venue:
StatFSM
SIG:
SIGFSM
Publisher:
Association for Computational Linguistics
Note:
Pages:
1–10
Language:
URL:
https://aclanthology.org/W16-2401
DOI:
10.18653/v1/W16-2401
Bibkey:
Cite (ACL):
Toni Dietze. 2016. Equivalences between Ranked and Unranked Weighted Tree Automata via Binarization. In Proceedings of the SIGFSM Workshop on Statistical NLP and Weighted Automata, pages 1–10, Berlin, Germany. Association for Computational Linguistics.
Cite (Informal):
Equivalences between Ranked and Unranked Weighted Tree Automata via Binarization (Dietze, StatFSM 2016)
Copy Citation:
PDF:
https://aclanthology.org/W16-2401.pdf