Image de couverture de livre

Certified Symbolic Finite Transducers: Formalization and Applications to String Analysis

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Kan, Shuanglong, Lin, Anthony W.
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)

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

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

Approximate Problems for Finite Transducers
par: Filiot, Emmanuel, et autres
Publié: (2025)

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

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

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)

String Solving with Stabilization and Transducers (Technical Report)
par: Chocholatý, David, et autres
Publié: (2026)

The Power of Hard Attention Transformers on Data Sequences: A Formal Language Theoretic Perspective
par: Bergsträßer, Pascal, et autres
Publié: (2024)

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

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)

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

Formalized Run-Time Analysis of Active Learning -- Coalgebraically in Agda
par: Wißmann, Thorsten
Publié: (2026)

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

Parikh's Theorem Made Symbolic
par: Hague, Matthew, et autres
Publié: (2023)

Active Learning of Symbolic Mealy Automata
par: Irie, Kengo, et autres
Publié: (2025)

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

WEX: Formal Specifications for Windows in Stream Processing
par: Hitarth, S, et autres
Publié: (2022)

A Formal Approach for Tuning Stochastic Oscillators
par: Ballarini, Paolo, et autres
Publié: (2024)

Closure Properties of General Grammars -- Formally Verified
par: Dvorak, Martin, et autres
Publié: (2023)

A General Information Extraction Framework Based on Formal Languages
par: Schmid, Markus L.
Publié: (2025)

A Unified Model for Real-Time Systems: Symbolic Techniques and Implementation
par: Akshay, S, et autres
Publié: (2023)

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)

Automated Formal Verification of Area-Optimized Safety Registers in Automotive SoCs
par: Zhang, Shuhang, et autres
Publié: (2025)

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)

An Automata-Based Method to Formalize Psychological Theories -- The Case Study of Lazarus and Folkman's Stress Theory
par: Finkel, Alain, et autres
Publié: (2025)

Mind the Gap: A Formal Investigation of the Relationship Between Log and Model Complexity -- Extended Version
par: Schalk, Patrizia, et autres
Publié: (2025)

Semiflows, Home Spaces, and Home States, Applications to the Analysis of Parameterized Petri Nets
par: Memmi, Gerard
Publié: (2025)

Learning Deterministic Finite-State Machines from the Prefixes of a Single String is NP-Complete
par: Dumitru, Radu Cosmin, et autres
Publié: (2026)

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

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)