Approximation of Weighted Automata with Storage

Approximation of Weighted Automata with Storage

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.

Bibliographic Details
Main Author: Tobias Denkinger
Format: Article
Language:English
Published: Open Publishing Association 2017-09-01
Series:Electronic Proceedings in Theoretical Computer Science
Online Access:http://arxiv.org/pdf/1703.09910v2
id doaj-008fce0cc99d4084a627711fb0e10b2b
record_format Article
spelling doaj-008fce0cc99d4084a627711fb0e10b2b2020-11-25T02:18:59ZengOpen Publishing AssociationElectronic Proceedings in Theoretical Computer Science2075-21802017-09-01256Proc. GandALF 20179110510.4204/EPTCS.256.7:13Approximation of Weighted Automata with StorageTobias DenkingerWe 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.http://arxiv.org/pdf/1703.09910v2
collection DOAJ
language English
format Article
sources DOAJ
author Tobias Denkinger
spellingShingle Tobias Denkinger
Approximation of Weighted Automata with Storage
Electronic Proceedings in Theoretical Computer Science
author_facet Tobias Denkinger
author_sort Tobias Denkinger
title Approximation of Weighted Automata with Storage
title_short Approximation of Weighted Automata with Storage
title_full Approximation of Weighted Automata with Storage
title_fullStr Approximation of Weighted Automata with Storage
title_full_unstemmed Approximation of Weighted Automata with Storage
title_sort approximation of weighted automata with storage
publisher Open Publishing Association
series Electronic Proceedings in Theoretical Computer Science
issn 2075-2180
publishDate 2017-09-01
description 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.
url http://arxiv.org/pdf/1703.09910v2
work_keys_str_mv AT tobiasdenkinger approximationofweightedautomatawithstorage
_version_ 1724879484266479616

Similar Items