:: Library Catalog

Íomhá chlúdaigh

Sábháilte in:

Sonraí bibleagrafaíochta
Príomhchruthaitheoirí:	Amarilli, Antoine, Barloy, Corentin, Jachiet, Louis, Paperman, Charles
Formáid:	Preprint
Foilsithe / Cruthaithe:	2025
Ábhair:	Formal Languages and Automata Theory Data Structures and Algorithms
Rochtain ar líne:	https://arxiv.org/abs/2504.17536
Clibeanna:	Cuir clib leis Níl clibeanna ann, Bí ar an gcéad duine le clib a chur leis an taifead seo!

Míreanna comhchosúla

Out-of-Order Membership in Regular Languages
de réir: Amarilli, Antoine, et al.
Foilsithe / Cruthaithe: (2026)

Constant-Time Dynamic Enumeration of Word Infixes in a Regular Language
de réir: Amarilli, Antoine, et al.
Foilsithe / Cruthaithe: (2026)

Linear Time Subsequence and Supersequence Regex Matching
de réir: Amarilli, Antoine, et al.
Foilsithe / Cruthaithe: (2025)

Locality and Centrality: The Variety ZG
de réir: Amarilli, Antoine, et al.
Foilsithe / Cruthaithe: (2021)

A Circus of Circuits: Connections Between Decision Diagrams, Circuits, and Automata
de réir: Amarilli, Antoine, et al.
Foilsithe / Cruthaithe: (2024)

$k$-Universality of Regular Languages Revisited
de réir: Adamson, Duncan, et al.
Foilsithe / Cruthaithe: (2025)

Efficient Matching of Some Fundamental Regular Expressions with Backreferences
de réir: Nogami, Taisei, et al.
Foilsithe / Cruthaithe: (2025)

Language Edit Distance & Scored Parsing: Faster Algorithms & Connection to Fundamental Graph Problems
de réir: Kociumaka, Tomasz, et al.
Foilsithe / Cruthaithe: (2014)

Prefix Trees Improve Memory Consumption in Large-Scale Continuous-Time Stochastic Models
de réir: Taylor, Landon, et al.
Foilsithe / Cruthaithe: (2025)

The Alternation Hierarchy of First-Order Logic on Words is Decidable
de réir: Barloy, Corentin, et al.
Foilsithe / Cruthaithe: (2025)

Shuffles of Context-Free Languages along Regular Trajectories
de réir: Barloy, Corentin, et al.
Foilsithe / Cruthaithe: (2026)

Algorithmical Aspects of Some Bio Inspired Operations
de réir: Dumitran, Marius
Foilsithe / Cruthaithe: (2025)

On Minimizers of Minimum Density
de réir: Shur, Arseny
Foilsithe / Cruthaithe: (2025)

Efficiently Finding All Minimal and Shortest Absent Subsequences in a String
de réir: Manea, Florin, et al.
Foilsithe / Cruthaithe: (2025)

A closer look at TDFA
de réir: Borsotti, Angelo, et al.
Foilsithe / Cruthaithe: (2022)

Maximal Closed Substrings
de réir: Badkobeh, Golnaz, et al.
Foilsithe / Cruthaithe: (2022)

Novel Results on the Number of Runs of the Burrows-Wheeler-Transform
de réir: Giuliani, Sara, et al.
Foilsithe / Cruthaithe: (2020)

A Fast Algorithm for Computing Prefix Probabilities
de réir: Nowak, Franz, et al.
Foilsithe / Cruthaithe: (2023)

Generating a Gray code for prefix normal words in amortized polylogarithmic time per word
de réir: Burcsi, Péter, et al.
Foilsithe / Cruthaithe: (2020)

Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space
de réir: Inenaga, Shunsuke, et al.
Foilsithe / Cruthaithe: (2024)

Absent Subsequences in Words
de réir: Kosche, Maria, et al.
Foilsithe / Cruthaithe: (2021)

Exponent-Strings and Their Edit Distance
de réir: Baek, Ingyu
Foilsithe / Cruthaithe: (2024)

Subsequences in Bounded Ranges: Matching and Analysis Problems
de réir: Kosche, Maria, et al.
Foilsithe / Cruthaithe: (2022)

Indexing Finite-State Automata Using Forward-Stable Partitions
de réir: Becker, Ruben, et al.
Foilsithe / Cruthaithe: (2024)

Deciding Reachability and the Covering Problem with Diagnostics for Sound Acyclic Free-Choice Workflow Nets
de réir: Prinz, Thomas M., et al.
Foilsithe / Cruthaithe: (2026)

Wheeler Bisimulations
de réir: Cotumaccio, Nicola
Foilsithe / Cruthaithe: (2026)

The Inverse Lyndon Array: Definition, Properties, and Linear-Time Construction
de réir: Negri, Pietro, et al.
Foilsithe / Cruthaithe: (2026)

Linear-size Suffix Tries and Linear-size CDAWGs Simplified and Improved
de réir: Inenaga, Shunsuke
Foilsithe / Cruthaithe: (2024)

Hardness of Regular Expression Matching with Extensions
de réir: Nogami, Taisei, et al.
Foilsithe / Cruthaithe: (2026)

Dynamic direct access of MSO query evaluation over strings
de réir: Bourhis, Pierre, et al.
Foilsithe / Cruthaithe: (2024)

Smallest Suffixient Sets: Effectiveness, Resilience, and Calculation
de réir: Fujimaru, Hiroto, et al.
Foilsithe / Cruthaithe: (2025)

Fine-Grained Complexity of Regular Path Queries
de réir: Casel, Katrin, et al.
Foilsithe / Cruthaithe: (2021)

Complex event recognition meets hierarchical conjunctive queries
de réir: Pinto, Dante, et al.
Foilsithe / Cruthaithe: (2024)

Distinct Shortest Walk Enumeration for RPQs
de réir: David, Claire, et al.
Foilsithe / Cruthaithe: (2023)

Revisiting Weighted Information Extraction: A Simpler and Faster Algorithm for Ranked Enumeration
de réir: Gawrychowski, Pawel, et al.
Foilsithe / Cruthaithe: (2024)

The NFA Acceptance Hypothesis: Non-Combinatorial and Dynamic Lower Bounds
de réir: Bringmann, Karl, et al.
Foilsithe / Cruthaithe: (2023)

Tokenisation is NP-Complete
de réir: Whittington, Philip, et al.
Foilsithe / Cruthaithe: (2024)

On the Complexity of Language Membership for Probabilistic Words
de réir: Amarilli, Antoine, et al.
Foilsithe / Cruthaithe: (2025)

Spectral and combinatorial methods for efficiently computing the rank of unambiguous finite automata
de réir: Kiefer, Stefan, et al.
Foilsithe / Cruthaithe: (2025)

Optimal Sequential Flows
de réir: Gimbert, Hugo, et al.
Foilsithe / Cruthaithe: (2025)