Image de couverture de livre

Edit Distance of Finite State Transducers

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Aiswarya, C., Manuel, Amaldev, Sunny, Saina
Format:	Preprint
Publié:	2024
Sujets:	Formal Languages and Automata Theory Logic in Computer Science F.1.1
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

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

Satisfiability of Context-free String Constraints with Subword-ordering and Transducers
par: Aiswarya, C, et autres
Publié: (2024)

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

PVASS Reachability is Decidable
par: Guttenberg, Roland, et autres
Publié: (2025)

Reachability and Related Problems in Vector Addition Systems with Nested Zero Tests
par: Guttenberg, Roland, et autres
Publié: (2025)

Finitely Presentable Higher-Dimensional Automata and the Irrationality of Process Replication
par: Basold, Henning, et autres
Publié: (2023)

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

How Concise are Chains of co-Büchi Automata?
par: Ehlers, Rüdiger
Publié: (2025)

A Decision Procedure for Probabilistic Kleene Algebra with Angelic Nondeterminism
par: Ong, Shawn, et autres
Publié: (2025)

Set Automata and Limits of Decidability of Two-Variable Logic on Data Words
par: Guha, Shibashis, et autres
Publié: (2026)

Constructing Weakly Terminating Interface Protocols
par: Bera, Debjyoti, et autres
Publié: (2026)

Equivariant ideals of polynomials
par: Ghosh, Arka, et autres
Publié: (2024)

On Constructing Finite Automata by Relational Programming
par: Egri-Nagy, Attila, et autres
Publié: (2025)

Orbit-finite linear programming
par: Ghosh, Arka, et autres
Publié: (2023)

A Nivat Theorem for Weighted Alternating Automata over Commutative Semirings
par: Grabolle, Gustav
Publié: (2022)

Model-Checking PCTL Properties of Stateless Probabilistic Pushdown Systems
par: Lin, Deren, et autres
Publié: (2014)

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

From Compactifying Lambda-Letrec Terms to Recognizing Regular-Expression Processes
par: Grabmayer, Clemens
Publié: (2024)

Visualising CTL Witnesses and Counterexamples -- Extended Version
par: Rensink, Arend
Publié: (2026)

Inquisitive Team Semantics of LTL
par: Bozzelli, Laura, et autres
Publié: (2025)

GOL in GOL in HOL: Verified Circuits in Conway's Game of Life
par: Myreen, Magnus O., et autres
Publié: (2025)

Minimization of Streaming Transducers
par: Bianchini, Christian, et autres
Publié: (2026)

Dynamically Reprogrammable Runtime Monitors for Bounded-time MTL
par: Hebballi, Chirantan, et autres
Publié: (2026)

Simulation by Rounds of Letter-to-Letter Transducers
par: Nassar, Antonio Abu, et autres
Publié: (2021)

The Algebra of Nondeterministic Finite Automata
par: Gorrieri, Roberto
Publié: (2023)

Deterministic Suffix-reading Automata
par: Keerthan, R, et autres
Publié: (2024)

Separability in Büchi Vass and Singly Non-Linear Systems of Inequalities
par: Baumann, Pascal, et autres
Publié: (2024)

Reachability for Multi-Priced Timed Automata with Positive and Negative Rates
par: Scoones, Andrew, et autres
Publié: (2024)

Equivalence of Deterministic Weighted Real-time One-Counter Automata
par: Mathew, Prince, et autres
Publié: (2024)

Flattability of Priority Vector Addition Systems
par: Guttenberg, Roland
Publié: (2024)

Checking Timed Bisimilarity with Virtual Clocks
par: Lieb, Alexander, et autres
Publié: (2024)

Exploring VASS Parameterised by Geometric Dimension
par: Czerwiński, Wojciech, et autres
Publié: (2026)

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

Have a thing? Reasoning around recursion with dynamic typing in grounded arithmetic
par: Bobrow, Elliot, et autres
Publié: (2025)

Slightly Non-Linear Higher-Order Tree Transducers
par: Nguyên, Lê Thành Dũng, et autres
Publié: (2024)

Probabilistic Finite Automaton Emptiness is undecidable
par: Rote, Günter
Publié: (2024)

On Repetitive Finite Automata with Translucent Words
par: Mráz, František, et autres
Publié: (2025)

Geometric Characterization of Context-Free Intersections via the Inner Segment Dichotomy
par: Silva, Jorge Miguel
Publié: (2026)

Complete Compositional Syntax for Finite Transducers on Finite and Bi-Infinite Words
par: Carette, Titouan, et autres
Publié: (2025)

Taking Complete Finite Prefixes To High Level, Symbolically
par: Würdemann, Nick, et autres
Publié: (2023)