Cover Image

Universally Wheeler Languages

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Becker, Ruben, Castiglione, Giuseppa, D'Agostino, Giovanna, Policriti, Alberto, Prezza, Nicola, Restivo, Antonio, Riccardi, Brian
Format:	Preprint
Published:	2025
Subjects:	Formal Languages and Automata Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Novel Results on the Number of Runs of the Burrows-Wheeler-Transform
by: Giuliani, Sara, et al.
Published: (2020)

Indexing Finite-State Automata Using Forward-Stable Partitions
by: Becker, Ruben, et al.
Published: (2024)

Wheeler Bisimulations
by: Cotumaccio, Nicola
Published: (2026)

Decidable problems in substitution shifts
by: Béal, Marie-Pierre, et al.
Published: (2021)

Characterization of Isometric Words based on Swap and Mismatch Distance
by: Anselmo, M., et al.
Published: (2024)

Unveiling the connection between the Lyndon factorization and the Canonical Inverse Lyndon factorization via a border property
by: Bonizzoni, Paola, et al.
Published: (2024)

Universality Frontier for Asynchronous Cellular Automata
by: Baburin, Ivan, et al.
Published: (2025)

Temporal Causal Models as a Model of Computation
by: Gladyshev, Maksim, et al.
Published: (2026)

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 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)

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)

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)

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)

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

Shuffles of Context-Free Languages along Regular Trajectories
by: Barloy, Corentin, 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)

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

A General Information Extraction Framework Based on Formal Languages
by: Schmid, Markus L.
Published: (2025)

Distribution of Reconfiguration Languages maintaining Tree-like Communication Topology
by: Hausmann, Daniel, et al.
Published: (2024)

Algebraic Characterization of FO-definable Languages of Higher-Dimensional Automata
by: Erlich, Enzo, et al.
Published: (2026)

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

Star Complexity of Parikh Images of Languages over Infinite Alphabets
by: Danieli, Yoav
Published: (2026)

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

History-Deterministic Büchi Automata are Succinct
by: Casares, Antonio, et al.
Published: (2026)

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

Regular Expressions with Backreferences on Multiple Context-Free Languages, and the Closed-Star Condition
by: Nogami, Taisei, et al.
Published: (2024)

The Power of Hard Attention Transformers on Data Sequences: A Formal Language Theoretic Perspective
by: Bergsträßer, Pascal, et al.
Published: (2024)

On the Minimisation of Deterministic and History-Deterministic Generalised (co)Büchi Automata
by: Casares, Antonio, et al.
Published: (2024)

Twinning automata and regular expressions for string static analysis
by: Negrini, Luca, et al.
Published: (2020)

Quantum finite automata and linear context-free languages: a decidable problem
by: Bertoni, A., et al.
Published: (2013)