# Approximation of Weighted Automata with Storage

## TL;DR

This paper introduces a framework using non-deterministic storage types to approximate automata with storage, enabling new automata-theoretic insights into complex language classes and parsing strategies.

## Contribution

It presents a novel approach for approximating automata with storage using non-deterministic storage types, linking automata theory with language approximation and parsing.

## Key findings

- Framework for automata approximation with storage
- Automata-theoretic insights into multiple context-free languages
- Application to coarse-to-fine parsing

## 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.

---
Source: https://tomesphere.com/paper/1703.09910