Approximation of Weighted Automata with Storage

2017/03/31 by Tobias Denkinger
Computer Science · #cs.FL

paper · pdf · doi:10.4204/eptcs.256.7

published as EPTCS 256, 2017, pp. 91-105 · In Proceedings GandALF 2017, arXiv:1709.01761

arxiv created 2017/09/07 · arxiv updated 2017/09/08

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.

Citations

• Proceedings Eighth International Symposium on Games, Automata, Logics and Formal Verification