Showing cs.FLShow all
2 papers · 1 filter
cs.FL2026
Star Complexity of Parikh Images of Languages over Infinite Alphabets
Yoav Danieli
It has been conjectured that the Parikh (commutative) image of every language over an infinite alphabet recognized by an automaton with registers is defined by a rational expressio…
cs.FL2025
A pumping-like lemma for languages over infinite alphabets
Yoav Danieli
We prove a kind of a pumping lemma for languages accepted by one-register alternating finite-memory automata. As a corollary, we obtain that the set of lengths of words in such lan…