Sciweavers

Share
TCS
2010

Definable transductions and weighted logics for texts

9 years 4 months ago
Definable transductions and weighted logics for texts
A text is a word together with an additional linear order on it. We study quantitative models for texts, i.e. text series which assign to texts elements of a semiring. We introduce an algebraic notion of recognizability following Reutenauer and Bozapalidis as well as weighted automata for texts combining an automaton model of Lodaya and Weil with a model of
Christian Mathissen
Added 21 May 2011
Updated 21 May 2011
Type Journal
Year 2010
Where TCS
Authors Christian Mathissen
Comments (0)
books