Showing cs.FLShow all
3 papers · 1 filter
cs.FL2026
On Word Representations and Embeddings in Complex Matrices
Paul C. Bell, George Kenison, Reino Niskanen +2
Embeddings of word structures into matrix semigroups provide a natural bridge between combinatorics on words and linear algebra. However, low-dimensional matrix semigroups impose s…
cs.FL2019
Monadic Decomposability of Regular Relations
Pablo Barcelo, Chih-Duo Hong, Xuan-Bach Le +2
Monadic decomposibility --- the ability to determine whether a formula in a given logical theory can be decomposed into a boolean combination of monadic formulas --- is a powerful…
cs.FL2014
Weighted automata on infinite words in the context of Attacker-Defender games
Vesa Halava, Tero Harju, Reino Niskanen +1
We consider infinite-state Attacker-Defender games with reachability objectives. The results of the paper are twofold. Firstly we prove a new language-theoretic result for weighted…