Approximation of Weighted Automata with Storage

descriptionPublicationkeyboard_double_arrow_right Article , Preprint , Conference object , Other literature type 06 Sep 2017Embargo end date: 01 Jan 2017 English Publisher:Open Publishing AssociationJournal:Electronic Proceedings in Theoretical Computer Science, volume 256, pages 91-105 (eissn: 2075-2180,

Copyright policy )

Authors: Tobias Denkinger;

doi: 10.4204/eptcs.256.7 , 10.48550/arxiv.1703.09910

arXiv: 1703.09910

Approximation of Weighted Automata with Storage

- Summary
- Subjects
- Metrics

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.

In Proceedings GandALF 2017, arXiv:1709.01761

Related Organizations

TU Dresden
Germany
TECHNISCHE UNIVERSITAET DRESDEN
Germany

Keywords

FOS: Computer and information sciences, Formal Languages and Automata Theory (cs.FL), Electronic computers. Computer science, QA1-939, Computer Science - Formal Languages and Automata Theory, QA75.5-76.95, Mathematics

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	0
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average