Image de couverture de livre

Approximate Problems for Finite Transducers

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Filiot, Emmanuel, Jecker, Ismaël, Madnani, Khushraj, Sunny, Saina
Format:	Preprint
Publié:	2025
Sujets:	Formal Languages and Automata Theory
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Finite-valued Streaming String Transducers
par: Filiot, Emmanuel, et autres
Publié: (2024)

A Regular and Complete Notion of Delay for Streaming String Transducers
par: Filiot, Emmanuel, et autres
Publié: (2022)

Edit Distance of Finite-Valued Transducers
par: Mathew, Prince, et autres
Publié: (2026)

Edit Distance of Finite State Transducers
par: Aiswarya, C., et autres
Publié: (2024)

MightyPPL: Verification of MITL with Past and Pnueli Modalities
par: Ho, Hsi-Ming, et autres
Publié: (2025)

History-deterministic Parikh Automata
par: Erlich, Enzo, et autres
Publié: (2022)

Certified Symbolic Finite Transducers: Formalization and Applications to String Analysis
par: Kan, Shuanglong, et autres
Publié: (2025)

Synthesizing Computable Functions from Rational Specifications over Infinite Words
par: Filiot, Emmanuel, et autres
Publié: (2021)

An efficient quantifier elimination procedure for Presburger arithmetic
par: Haase, Christoph, et autres
Publié: (2024)

A Theory of Hanoi Omega-Automata and Games
par: Filiot, Emmanuel, et autres
Publié: (2026)

Determinisation and Unambiguisation of Polynomially-Ambiguous Rational Weighted Automata
par: Jecker, Ismaël, et autres
Publié: (2023)

Deciding Conjugacy of a Rational Relation
par: Aiswarya, C., et autres
Publié: (2023)

Reversible Pebble Transducers
par: Dartois, Luc, et autres
Publié: (2025)

Reachability in 3-VASS is Elementary
par: Czerwiński, Wojciech, et autres
Publié: (2025)

A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct
par: Guha, Shibashis, et autres
Publié: (2021)

Composing Copyless Streaming String Transducers
par: Alur, Rajeev, et autres
Publié: (2022)

Attributed Tree Transducers for Partial Functions
par: Maneth, Sebastian, et autres
Publié: (2024)

Reversible Transducers over Infinite Words
par: Dartois, Luc, et autres
Publié: (2024)

Minimizing Streaming String Transducers: An algebraic approach
par: Benalioua, Yahia Idriss, et autres
Publié: (2026)

Active Learning of Deterministic Transducers with Outputs in Arbitrary Monoids
par: Aristote, Quentin
Publié: (2024)

Optimal Approximate Minimization of One-Letter Weighted Finite Automata
par: Lacroce, Clara, et autres
Publié: (2023)

Deciding Linear Height and Linear Size-to-Height Increase for Macro Tree Transducers
par: Gallot, Paul, et autres
Publié: (2023)

Deciding whether an Attributed Translation can be realized by a Top-Down Transducer
par: Maneth, Sebastian, et autres
Publié: (2023)

Transducing Language Models
par: Snæbjarnarson, Vésteinn, et autres
Publié: (2026)

An Automata-Based Approach to Games with $ω$-Automatic Preferences
par: Bruyère, Véronique, et autres
Publié: (2026)

A Diamond Structure in the Transducer Hierarchy
par: Kaufmann, Noah
Publié: (2021)

Transformers as Transducers
par: Strobl, Lena, et autres
Publié: (2024)

Cayley Automatic Groups and Numerical Characteristics of Turing Transducers
par: Berdinsky, Dmitry
Publié: (2016)

Synthesis of Computable Regular Functions of Infinite Words
par: Dave, V., et autres
Publié: (2019)

Decomposition of Automata recognizing Ideals
par: Berry, Mathias, et autres
Publié: (2026)

Finite Automata for Efficient Graph Recognition
par: Drewes, Frank, et autres
Publié: (2024)

Repetitive Finite Automata With Translucent Letters
par: Mráz, František, et autres
Publié: (2024)

Finite maximal codes and factorizations of cyclic groups
par: De Felice, Clelia
Publié: (2022)

Descriptional Complexity of Finite Automata -- Selected Highlights
par: Salomaa, Arto, et autres
Publié: (2023)

Measure Many Quantum Finite Automata on Infinite Words
par: Midya, Abhisek, et autres
Publié: (2026)

Fast and General Automatic Differentiation for Finite-State Methods
par: Yang, Lucas Ondel, et autres
Publié: (2026)

Efficient Constructions of Finite-State Independent Normal Pairs
par: Pulari, Subin
Publié: (2026)

Reversible Weighted Automata over Finite Rings and Monoids with Commuting Idempotents
par: Kostolányi, Peter, et autres
Publié: (2026)

Mata, a Fast and Simple Finite Automata Library (Technical Report)
par: Chocholatý, David, et autres
Publié: (2023)

Active Inference of Extended Finite State Machine Models with Registers and Guards
par: Groz, Roland, et autres
Publié: (2026)