DOAJ Open Access 2017

Approximation of Weighted Automata with Storage

Tobias Denkinger

Lihat Sumber DOI

Abstrak

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.

Topik & Kata Kunci

Mathematics Electronic computers. Computer science

Penulis (1)

Tobias Denkinger

Format Sitasi

APA MLA BibTeX

Denkinger, T. (2017). Approximation of Weighted Automata with Storage. https://doi.org/10.4204/EPTCS.256.7

Akses Cepat

Lihat di Sumber doi.org/10.4204/EPTCS.256.7

Informasi Jurnal

Tahun Terbit: 2017
Sumber Database: DOAJ
DOI: 10.4204/EPTCS.256.7
Akses: Open Access ✓