Article thumbnail
Location of Repository

Approximation of Weighted Automata with Storage

By Tobias Denkinger

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.Comment: In Proceedings GandALF 2017, arXiv:1709.0176

Topics: Computer Science - Formal Languages and Automata Theory
Publisher: 'Open Publishing Association'
Year: 2017
DOI identifier: 10.4204/EPTCS.256.7
OAI identifier: oai:arXiv.org:1703.09910

Suggested articles


To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.