Cover Image

Synthesizing Computable Functions from Rational Specifications over Infinite Words

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Filiot, Emmanuel, Winter, Sarah
Format:	Preprint
Published:	2021
Subjects:	Formal Languages and Automata Theory Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Synthesis of Computable Regular Functions of Infinite Words
by: Dave, V., et al.
Published: (2019)

Parikh Automata on Finite and Infinite Words
by: Grobler, Mario, et al.
Published: (2023)

Tracy, Traces, and Transducers: Computable Counterexamples and Explanations for HyperLTL Model-Checking
by: Winter, Sarah, et al.
Published: (2024)

Prophecies all the Way: Game-based Model-Checking for HyperQPTL beyond $\forall^*\exists^*$
by: Winter, Sarah, et al.
Published: (2025)

Logics for Context-free Hyperproperties
by: Winter, Sarah, et al.
Published: (2026)

An Automaton-based Characterisation of First-Order Logic over Infinite Trees
by: Benerecetti, Massimo, et al.
Published: (2025)

Automaton-based Characterisations of First Order Logic over Infinite Trees
by: Benerecetti, Massimo, et al.
Published: (2026)

Positive First-order Logic on Words and Graphs
by: Kuperberg, Denis
Published: (2022)

The Alternation Hierarchy of First-Order Logic on Words is Decidable
by: Barloy, Corentin, et al.
Published: (2025)

Large Scale Geometries of Infinite Strings
by: Khoussainov, Bakhadyr, et al.
Published: (2019)

Beyond Decisiveness of Infinite Markov Chains
by: Barbot, Benoît, et al.
Published: (2024)

Quasi-Isometric Reductions Between Infinite Strings
by: Celine, Karen Frilya, et al.
Published: (2024)

Determinisation and Unambiguisation of Polynomially-Ambiguous Rational Weighted Automata
by: Jecker, Ismaël, et al.
Published: (2023)

Complete Compositional Syntax for Finite Transducers on Finite and Bi-Infinite Words
by: Carette, Titouan, et al.
Published: (2025)

Set Automata and Limits of Decidability of Two-Variable Logic on Data Words
by: Guha, Shibashis, et al.
Published: (2026)

A Regular and Complete Notion of Delay for Streaming String Transducers
by: Filiot, Emmanuel, et al.
Published: (2022)

Function spaces for orbit-finite sets
by: Bojańczyk, Mikołaj, et al.
Published: (2024)

From Sound Workflow Nets to LTLf Declarative Specifications by Casting Three Spells
by: Barbaro, Luca, et al.
Published: (2025)

A Practical Specification Language for Automatic Quantum Program Verification (Technical Report)
by: Tsai, Wei-Lun, et al.
Published: (2026)

Existential Definability over the Subword Ordering
by: Baumann, Pascal, et al.
Published: (2022)

Monitorability for the Modal mu-Calculus over Systems with Data: From Practice to Theory
by: Aceto, Luca, et al.
Published: (2025)

Word equations, constraints, and formal languages
by: Ciobanu, Laura
Published: (2024)

On the Existence of Reactive Strategies Resilient to Delay
by: Fränzle, Martin, et al.
Published: (2023)

Full LTL Synthesis over Infinite-state Arenas
by: Azzopardi, Shaun, et al.
Published: (2023)

A cyclic proof system for Guarded Kleene Algebra with Tests (full version)
by: Rooduijn, Jan, et al.
Published: (2024)

A proof theory of right-linear (omega-)grammars via cyclic proofs
by: Das, Anupam, et al.
Published: (2024)

An algebraic theory of ω-regular languages, via μν-expressions
by: Das, Anupam, et al.
Published: (2025)

An efficient quantifier elimination procedure for Presburger arithmetic
by: Haase, Christoph, et al.
Published: (2024)

Cyclic system for an algebraic theory of alternating parity automata
by: Das, Anupam, et al.
Published: (2025)

Fractals from Regular Behaviours
by: Schmid, Todd, et al.
Published: (2023)

Rethinking meaning and ontologies from the perspective of ontological units
by: Fabry, Paul, et al.
Published: (2025)

LTLf+ and PPLTL+: Extending LTLf and PPLTL to Infinite Traces
by: Aminof, Benjamin, et al.
Published: (2024)

sweap: Reactive Synthesis for Infinite-State Integer Problems
by: Azzopardi, Shaun, et al.
Published: (2026)

A Direct Translation from LTL with Past to Deterministic Rabin Automata
by: Azzopardi, Shaun, et al.
Published: (2024)

SemML 2.0: Synthesizing Controllers for LTL
by: Křetínský, Jan, et al.
Published: (2026)

Finite-valued Streaming String Transducers
by: Filiot, Emmanuel, et al.
Published: (2024)

Runtime Verification via Rational Monitor with Imperfect Information
by: Ferrando, Angelo, et al.
Published: (2024)

A Theory of Hanoi Omega-Automata and Games
by: Filiot, Emmanuel, et al.
Published: (2026)

Synthesizing POMDP Policies: Sampling Meets Model-checking via Learning
by: Chakraborty, Debraj, et al.
Published: (2026)

Simulation by Rounds of Letter-to-Letter Transducers
by: Nassar, Antonio Abu, et al.
Published: (2021)