Approximation of Weighted Automata with Storage
arXiv:1703.09910 · doi:10.4204/EPTCS.256.7
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.
In Proceedings GandALF 2017, arXiv:1709.01761