Image de couverture de livre

Constructing Concise Characteristic Samples for Acceptors of Omega Regular Languages

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Angluin, Dana, Fisman, Dana
Format:	Preprint
Publié:	2022
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

Omega-Regular Robustness
par: Fisman, Dana, et autres
Publié: (2025)

Atomic Gliders and CA as Language Generators (Extended Version)
par: Fisman, Dana, et autres
Publié: (2025)

Runtime Consultants
par: Fisman, Dana, et autres
Publié: (2025)

A Robust Measure on FDFAs Following Duo-Normalized Acceptance
par: Fisman, Dana, et autres
Publié: (2023)

Inferring Symbolic Automata
par: Fisman, Dana, et autres
Publié: (2021)

Masked Hard-Attention Transformers Recognize Exactly the Star-Free Languages
par: Yang, Andy, et autres
Publié: (2023)

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

Simulating Hard Attention Using Soft Attention
par: Yang, Andy, et autres
Publié: (2024)

Asymptotic Hausdorff and Language Similarity
par: Fisman, Dana, et autres
Publié: (2026)

What Formal Languages Can Transformers Express? A Survey
par: Strobl, Lena, et autres
Publié: (2023)

Decoupled Planning for Multiple Omega-Regular Objectives
par: Avni, Guy, et autres
Publié: (2026)

Regular Languages in the Sliding Window Model
par: Ganardi, Moses, et autres
Publié: (2024)

Positive Characteristic Sets for Relational Pattern Languages
par: Mousawi, S. Mahmoud, et autres
Publié: (2025)

Shuffles of Context-Free Languages along Regular Trajectories
par: Barloy, Corentin, et autres
Publié: (2026)

RNN Generalization to Omega-Regular Languages
par: Pert, Charles, et autres
Publié: (2025)

On the Complexity of Computing the Co-lexicographic Width of a Regular Language
par: Becker, Ruben, et autres
Publié: (2024)

Regular Expressions with Backreferences on Multiple Context-Free Languages, and the Closed-Star Condition
par: Nogami, Taisei, et autres
Publié: (2024)

On the Expressive Power of Regular Expressions with Backreferences
par: Nogami, Taisei, et autres
Publié: (2023)

Weighted Automata and Regular Expressions for Financial Systems
par: Droste, Manfred, et autres
Publié: (2026)

Regular Grammars for Sets of Graphs of Tree-Width 2
par: Bozga, Marius, et autres
Publié: (2024)

Directed Regular and Context-Free Languages
par: Ganardi, Moses, et autres
Publié: (2024)

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

Well-Behaved (Co)algebraic Semantics of Regular Expressions in Dafny
par: Zetzsche, Stefan, et autres
Publié: (2024)

The Power-Set Construction for Tree Algebras
par: Blumensath, Achim
Publié: (2022)

A Close Analysis of the Subset Construction
par: Baburin, Ivan, et autres
Publié: (2024)

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

GrappaRE -- A Tool for Efficient Graph Recognition Based on Finite Automata and Regular Expressions
par: De Rosa, Mattia, et autres
Publié: (2025)

Constructing Deterministic Parity Automata from Positive and Negative Examples
par: Bohn, León, et autres
Publié: (2023)

Efficient Construction of Reachability Graphs for Petri Net Product Lines
par: Gómez-Martínez, Elena, et autres
Publié: (2026)

Synthesis from LTL with Reward Optimization in Sampled Oblivious Environments
par: Raskin, Jean-François, et autres
Publié: (2024)

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

Compiling Quantum Regular Language States
par: Bellante, Armando, et autres
Publié: (2026)

Universally Wheeler Languages
par: Becker, Ruben, et autres
Publié: (2025)

Quantitative Language Automata
par: Henzinger, Thomas A., et autres
Publié: (2025)

Positive Varieties of Lattice Languages
par: Inoue, Yusuke, et autres
Publié: (2025)

The Complexity of Aggregates over Extractions by Regular Expressions
par: Doleschal, Johannes, et autres
Publié: (2020)

On the Complexity of Language Membership for Probabilistic Words
par: Amarilli, Antoine, et autres
Publié: (2025)

Stochastic Languages at Sub-stochastic Cost
par: Agarwal, Smayan, et autres
Publié: (2025)

On the Separability Problem of VASS Reachability Languages
par: Keskin, Eren, et autres
Publié: (2024)

Operational State Complexity of Block Languages
par: Duarte, Guilherme, et autres
Publié: (2024)