13 citations · 16 across the 9 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
cs.FL2024
Finite-valued Streaming String Transducers
Emmanuel Filiot, Ismaël Jecker, Christof Löding +3
A transducer is finite-valued if for some bound k, it maps any given input to at most k outputs. For classical, one-way transducers, it is known since the 80s that finite valuednes…
cs.FL2024
On the Boolean Closure of Deterministic Top-Down Tree Automata
Christof Löding, Wolfgang Thomas
The class of Boolean combinations of tree languages recognized by deterministic top-down tree automata (also known as deterministic root-to-frontier automata) is studied. The probl…