Approximation of Weighted Automata with Storage
Formal Languages and Automata Theory
2017-09-08 v2
Abstract
We use a non-deterministic variant of storage types to develop a framework for the approximation of automata with storage. This framework is used to provide automata-theoretic views on the approximation of multiple context-free languages and on coarse-to-fine parsing.
Keywords
Cite
@article{arxiv.1703.09910,
title = {Approximation of Weighted Automata with Storage},
author = {Tobias Denkinger},
journal= {arXiv preprint arXiv:1703.09910},
year = {2017}
}
Comments
In Proceedings GandALF 2017, arXiv:1709.01761