:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Strobl, Lena, Angluin, Dana, Chiang, David, Rawski, Jonathan, Sabharwal, Ashish
Formato:	Preprint
Publicado:	2024
Materias:	Formal Languages and Automata Theory Machine Learning
Acceso en línea:	https://arxiv.org/abs/2404.02040
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Simulating Hard Attention Using Soft Attention
por: Yang, Andy, et al.
Publicado: (2024)

What Formal Languages Can Transformers Express? A Survey
por: Strobl, Lena, et al.
Publicado: (2023)

Masked Hard-Attention Transformers Recognize Exactly the Star-Free Languages
por: Yang, Andy, et al.
Publicado: (2023)

Constructing Concise Characteristic Samples for Acceptors of Omega Regular Languages
por: Angluin, Dana, et al.
Publicado: (2022)

Exact Expressive Power of Transformers with Padding
por: Merrill, William, et al.
Publicado: (2025)

The Illusion of State in State-Space Models
por: Merrill, William, et al.
Publicado: (2024)

Transformers in Uniform TC$^0$
por: Chiang, David
Publicado: (2024)

Revisiting Padded Transformer Expressivity: Which Architectural Choices Matter and Which Don't
por: Svete, Anej, et al.
Publicado: (2026)

Why Are Linear RNNs More Parallelizable?
por: Merrill, William, et al.
Publicado: (2026)

Counting Like Transformers: Compiling Temporal Counting Logic Into Softmax Transformers
por: Yang, Andy, et al.
Publicado: (2024)

Reversible Pebble Transducers
por: Dartois, Luc, et al.
Publicado: (2025)

Length Generalization Bounds for Transformers
por: Yang, Andy, et al.
Publicado: (2026)

Approximate Problems for Finite Transducers
por: Filiot, Emmanuel, et al.
Publicado: (2025)

Partial Answer of How Transformers Learn Automata
por: Zhang, Tiantian
Publicado: (2025)

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

Attributed Tree Transducers for Partial Functions
por: Maneth, Sebastian, et al.
Publicado: (2024)

Reversible Transducers over Infinite Words
por: Dartois, Luc, et al.
Publicado: (2024)

Composing Copyless Streaming String Transducers
por: Alur, Rajeev, et al.
Publicado: (2022)

Minimizing Streaming String Transducers: An algebraic approach
por: Benalioua, Yahia Idriss, et al.
Publicado: (2026)

Active Learning of Deterministic Transducers with Outputs in Arbitrary Monoids
por: Aristote, Quentin
Publicado: (2024)

Transducing Language Models
por: Snæbjarnarson, Vésteinn, et al.
Publicado: (2026)

Certified Symbolic Finite Transducers: Formalization and Applications to String Analysis
por: Kan, Shuanglong, et al.
Publicado: (2025)

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

The Counting Power of Transformers
por: Sälzer, Marco, et al.
Publicado: (2025)

Knee-Deep in C-RASP: A Transformer Depth Hierarchy
por: Yang, Andy, et al.
Publicado: (2025)

Deciding Linear Height and Linear Size-to-Height Increase for Macro Tree Transducers
por: Gallot, Paul, et al.
Publicado: (2023)

Deciding whether an Attributed Translation can be realized by a Top-Down Transducer
por: Maneth, Sebastian, et al.
Publicado: (2023)

A Diamond Structure in the Transducer Hierarchy
por: Kaufmann, Noah
Publicado: (2021)

Sampling from Your Language Model One Byte at a Time
por: Hayase, Jonathan, et al.
Publicado: (2025)

Learning Weighted Finite Automata over the Max-Plus Semiring and its Termination
por: Okudono, Takamasa, et al.
Publicado: (2024)

PDFA Distillation via String Probability Queries
por: Baumgartner, Robert, et al.
Publicado: (2024)

Certifying Robustness of Graph Convolutional Networks for Node Perturbation with Polyhedra Abstract Interpretation
por: Chen, Boqi, et al.
Publicado: (2024)

Extending AALpy with Passive Learning: A Generalized State-Merging Approach
por: von Berg, Benjamin, et al.
Publicado: (2025)

Finite Sentence-Interface Control for Learning Bounded-Fan-Out Linear MCFGs under Fixed Monoid Typing
por: Kuriyama, Takayuki
Publicado: (2026)

Deconstructing Subset Construction -- Reducing While Determinizing
por: Nicol, John, et al.
Publicado: (2025)

Learning Reward Machines from Partially Observed Policies
por: Shehab, Mohamad Louai, et al.
Publicado: (2025)

Stochastic Alignments: Matching an Observed Trace to Stochastic Process Models
por: Li, Tian, et al.
Publicado: (2025)

A Constructive Framework for Nondeterministic Automata via Time-Shared, Depth-Unrolled Feedforward Networks
por: Dhayalkar, Sahil Rajesh
Publicado: (2025)

Active Learning of Symbolic Automata Over Rational Numbers
por: Hagedorn, Sebastian, et al.
Publicado: (2025)

Learning Deterministic Finite-State Machines from the Prefixes of a Single String is NP-Complete
por: Dumitru, Radu Cosmin, et al.
Publicado: (2026)