:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Hausmann, Daniel, Lehaut, Mathieu, Piterman, Nir
Format:	Preprint
Published:	2024
Subjects:	Formal Languages and Automata Theory
Online Access:	https://arxiv.org/abs/2408.10708
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Adding Reconfiguration to Zielonka's Asynchronous Automata
by: Lehaut, Mathieu, et al.
Published: (2023)

From Trees to Tree-Like: Distribution and Synthesis for Asynchronous Automata
by: Lehaut, Mathieu, et al.
Published: (2026)

Faster and Smaller Solutions of Obliging Games
by: Hausmann, Daniel, et al.
Published: (2024)

Symbolic Synthesis for LTLf+ Obligations
by: De Giacomo, Giuseppe, et al.
Published: (2026)

One-clock synthesis problems
by: Lasota, Sławomir, et al.
Published: (2026)

Engineering an LTLf Synthesis Tool
by: Duret-Lutz, Alexandre, et al.
Published: (2025)

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

Emerson-Lei and Manna-Pnueli Games for LTLf+ and PPLTL+ Synthesis
by: Hausmann, Daniel, et al.
Published: (2025)

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

Fast Obligation Translation and Synthesis
by: Duret-Lutz, Alexandre, et al.
Published: (2026)

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

Distributional Learning of Graph Languages Generated by Fixed-Interface Clause Systems
by: Shoudai, Takayoshi, et al.
Published: (2026)

Distributional Learning of Context-Free Languages under Fixed Finite-Monoid Typing
by: Kuriyama, Takayuki
Published: (2014)

A pumping-like lemma for languages over infinite alphabets
by: Danieli, Yoav
Published: (2025)

Spatio-Temporal view on the Topological Functioning Model
by: Spichkova, Maria
Published: (2025)

A Tree Sampler for Bounded Context-Free Languages
by: Considine, Breandan
Published: (2024)

Some Remarks on First-Order Definable Tree Languages
by: Blumensath, Achim
Published: (2024)

Undecidability of the Emptiness Problem for Weak Models of Distributed Computing
by: Principato, Flavio T., et al.
Published: (2025)

Efficient Runtime Verification of Real-Time Systems under Parametric Communication Delays
by: Fränzle, Martin, et al.
Published: (2024)

Efficient Interaction-Based Offline Runtime Verification of Distributed Systems with Lifeline Removal
by: Mahe, Erwan, et al.
Published: (2024)

Universally Wheeler Languages
by: Becker, Ruben, et al.
Published: (2025)

Quantitative Language Automata
by: Henzinger, Thomas A., et al.
Published: (2025)

Positive Varieties of Lattice Languages
by: Inoue, Yusuke, et al.
Published: (2025)

On the Separability Problem of VASS Reachability Languages
by: Keskin, Eren, et al.
Published: (2024)

Operational State Complexity of Block Languages
by: Duarte, Guilherme, et al.
Published: (2024)

On the Representation and State Complexity of Block Languages
by: Duarte, Guilherme, et al.
Published: (2024)

Regular Languages in the Sliding Window Model
by: Ganardi, Moses, et al.
Published: (2024)

On the Complexity of Language Membership for Probabilistic Words
by: Amarilli, Antoine, et al.
Published: (2025)

Stochastic Languages at Sub-stochastic Cost
by: Agarwal, Smayan, et al.
Published: (2025)

A Characterization of Turing Machines that Compute Primitive Recursive Functions
by: Schwartz, Daniel G.
Published: (2025)

Positive Characteristic Sets for Relational Pattern Languages
by: Mousawi, S. Mahmoud, et al.
Published: (2025)

Idefix-Closed Languages and Their Application in Contextual Grammars
by: Ködding, Marvin, et al.
Published: (2025)

Visibly Pushdown Languages in Groups
by: Ciobanu, Laura, et al.
Published: (2026)

Greybox Learning of Languages Recognizable by Event-Recording Automata
by: Majumdar, Anirban, et al.
Published: (2024)

Kamp Theorem for Pomset Languages of Higher Dimensional Automata
by: Clement, Emily, et al.
Published: (2024)

Shuffles of Context-Free Languages along Regular Trajectories
by: Barloy, Corentin, et al.
Published: (2026)

Languages of Boundedly-Ambiguous Vector Addition Systems with States
by: Czerwiński, Wojciech, et al.
Published: (2025)

Atomic Gliders and CA as Language Generators (Extended Version)
by: Fisman, Dana, et al.
Published: (2025)

Measure-Theoretic Aspects of Star-Free and Group Languages
by: Sin'ya, Ryoma, et al.
Published: (2025)

On the Complexity of Computing the Co-lexicographic Width of a Regular Language
by: Becker, Ruben, et al.
Published: (2024)