3 papers
cs.FL2026
Edit Distance of Finite-Valued Transducers
Prince Mathew, Saina Sunny
Transducers generalise automata by producing output word(s) for each input word, thereby defining a relation over words. A transducer is said to be finite-valued if, for every inpu…
cs.LO2026
A Theory of Hanoi Omega-Automata and Games
Emmanuel Filiot, Allen Joseph, Guillermo A. Pérez +1
The Hanoi Omega-Automata (HOA) format has established itself as the definitive standard for encoding -regular automata in modern synthesis tools. While HOA is widely adopted due…
cs.FL2024
Edit Distance of Finite State Transducers
C. Aiswarya, Amaldev Manuel, Saina Sunny
We lift metrics over words to metrics over word-to-word transductions, by defining the distance between two transductions as the supremum of the distances of their respective outpu…