Image de couverture de livre

RNN Generalization to Omega-Regular Languages

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Pert, Charles, Alrajeh, Dalal, Russo, Alessandra
Format:	Preprint
Publié:	2025
Sujets:	Machine Learning Formal Languages and Automata Theory Logic in Computer Science
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

$ω$-regular Expression Synthesis from Transition-Based Büchi Automata
par: Pert, Charles, et autres
Publié: (2024)

Characterization and Decidability of FC-Definable Regular Languages
par: Thompson, Sam M., et autres
Publié: (2025)

Length Generalization Bounds for Transformers
par: Yang, Andy, et autres
Publié: (2026)

Algebraic Characterizations of Classes of Regular Languages in DynFO
par: Barloy, Corentin, et autres
Publié: (2026)

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

Fractals from Regular Behaviours
par: Schmid, Todd, et autres
Publié: (2023)

A Completeness Theorem for Probabilistic Regular Expressions
par: Różowski, Wojciech, et autres
Publié: (2023)

Synthesis of Computable Regular Functions of Infinite Words
par: Dave, V., et autres
Publié: (2019)

On The Space Complexity of Partial Derivatives of Regular Expressions with Shuffle
par: Ancona, Davide, et autres
Publié: (2025)

Transformers are Inherently Succinct
par: Bergsträßer, Pascal, et autres
Publié: (2025)

Softmax Transformers are Turing-Complete
par: Jiang, Hongjian, et autres
Publié: (2025)

Synthesis and Verification of Transformer Programs (Technical Report)
par: Jiang, Hongjian, et autres
Publié: (2026)

On the Expressiveness of State Space Models via Temporal Logics
par: Alsmann, Eric, et autres
Publié: (2026)

Learning Quantitative Automata Modulo Theories
par: Hsiung, Eric, et autres
Publié: (2024)

A Complete Propositional Dynamic Logic for Regular Expressions with Lookahead
par: Nakamura, Yoshiki
Publié: (2026)

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

Random Graph Generation in Context-Free Graph Languages
par: Vastarini, Federico, et autres
Publié: (2024)

The Alternation Hierarchy of First-Order Logic on Words is Decidable
par: Barloy, Corentin, et autres
Publié: (2025)

HornStr: Invariant Synthesis for Regular Model Checking as Constrained Horn Clauses(Technical Report)
par: Jiang, Hongjian, et autres
Publié: (2025)

Kofola 1.0: A Modular Approach to ω-Regular Complementation and Inclusion Checking (Technical Report)
par: Alexaj, Ondrej, et autres
Publié: (2026)

Image Reflection on Process Graphs -- A Novel Approach for the Completeness of an Axiomatization of 1-Free Regular Expressions Modulo Bisimilarity
par: Zhang, Yuanrui, et autres
Publié: (2023)

Automatic Generation of Safety-compliant Linear Temporal Logic via Large Language Model: A Self-supervised Framework
par: Li, Junle, et autres
Publié: (2025)

Tree Automata Acceptance up to Measurable Defect
par: Moyasari, Anita, et autres
Publié: (2026)

Tree transducers of linear size-to-height increase (and the additive conjunction of linear logic)
par: Dartois, Luc, et autres
Publié: (2026)

Extended CTG Generalization and Dynamic Adjustment of Generalization Strategies in IC3
par: Su, Yuheng, et autres
Publié: (2025)

Logic and Languages of Higher-Dimensional Automata
par: Amrane, Amazigh, et autres
Publié: (2024)

The Role of Logic and Automata in Understanding Transformers
par: Lin, Anthony W., et autres
Publié: (2025)

Counting Like Transformers: Compiling Temporal Counting Logic Into Softmax Transformers
par: Yang, Andy, et autres
Publié: (2024)

A Trichotomy for Regular Trail Queries
par: Martens, Wim, et autres
Publié: (2019)

Language Equivalence is Undecidable in VASS with Restricted Nondeterminism
par: Czerwiński, Wojciech, et autres
Publié: (2025)

A Uniform Framework for Language Inclusion Problems
par: Doveri, Kyveli, et autres
Publié: (2024)

Language Inclusion for Boundedly-Ambiguous Vector Addition Systems is Decidable
par: Czerwiński, Wojciech, et autres
Publié: (2022)

General Decidability Results for Systems with Continuous Counters
par: Balasubramanian, A. R., et autres
Publié: (2025)

The Complexity of Generalized HyperLTL with Stuttering and Contexts
par: Regaud, Gaëtan, et autres
Publié: (2025)

Aperiodicity, Star-freeness, and First-order Logic Definability of Operator Precedence Languages
par: Mandrioli, Dino, et autres
Publié: (2020)

A Practical Specification Language for Automatic Quantum Program Verification (Technical Report)
par: Tsai, Wei-Lun, et autres
Publié: (2026)

Generalized Parameter Lifting: Finer Abstractions for Parametric Markov Chains
par: Heck, Linus, et autres
Publié: (2025)

Model-Free Learning of Safe yet Effective Controllers
par: Bozkurt, Alper Kamil, et autres
Publié: (2021)

Semantic Tree-Width and Path-Width of Conjunctive Regular Path Queries
par: Figueira, Diego, et autres
Publié: (2022)

The Decision Problem for Regular First-Order Theories
par: Mathur, Umang, et autres
Publié: (2024)