Showing cs.FLShow all
2 papers · 1 filter
cs.FL2026
On smallest synchronizing terms over constant alphabets
Luisa Herrmann, Richard Mörbitz
We show a subexponential lower bound on the reset threshold of synchronizing deterministic finite tree automata (DTA) over alphabets of just two symbols. This significantly improve…
cs.FL2019
Weighted Parsing for Grammar-Based Language Models over Multioperator Monoids
Richard Mörbitz, Heiko Vogler
We develop a general framework for weighted parsing which is built on top of grammar-based language models and employs multioperator monoids as weight algebras. It generalizes prev…