1 citations · 2 across the 3 of their papers we have counts for
3 papers
cs.FL2017
Approximation of Weighted Automata with Storage
Tobias Denkinger
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 view…
cs.FL2016★ 1 cited
A Chomsky-Schützenberger representation for weighted multiple context-free languages
Tobias Denkinger
We prove a Chomsky-Schützenberger representation theorem for multiple context-free languages weighted over complete commutative strong bimonoids.
cs.FL2016★ 1 cited
An automata characterisation for multiple context-free languages
Tobias Denkinger
We introduce tree stack automata as a new class of automata with storage and identify a restricted form of tree stack automata that recognises exactly the multiple context-free lan…