:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Lotfi, Ali, McQuillan, Ian
Formato:	Preprint
Publicado:	2024
Materias:	Machine Learning Computation and Language Computer Vision and Pattern Recognition Data Structures and Algorithms Formal Languages and Automata Theory
Acceso en línea:	https://arxiv.org/abs/2409.02259
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

A Graph-Based Classical and Quantum Approach to Deterministic L-System Inference
por: Lotfi, Ali, et al.
Publicado: (2024)

Tokenisation is NP-Complete
por: Whittington, Philip, et al.
Publicado: (2024)

Subsequences in Bounded Ranges: Matching and Analysis Problems
por: Kosche, Maria, et al.
Publicado: (2022)

Prefix Trees Improve Memory Consumption in Large-Scale Continuous-Time Stochastic Models
por: Taylor, Landon, et al.
Publicado: (2025)

Deciding Reachability and the Covering Problem with Diagnostics for Sound Acyclic Free-Choice Workflow Nets
por: Prinz, Thomas M., et al.
Publicado: (2026)

Language Edit Distance & Scored Parsing: Faster Algorithms & Connection to Fundamental Graph Problems
por: Kociumaka, Tomasz, et al.
Publicado: (2014)

Hardness of Regular Expression Matching with Extensions
por: Nogami, Taisei, et al.
Publicado: (2026)

Spectral and combinatorial methods for efficiently computing the rank of unambiguous finite automata
por: Kiefer, Stefan, et al.
Publicado: (2025)

Symbolic Functional Decomposition: A Reconfiguration Approach
por: Oliveira, Mateus de Oliveira, et al.
Publicado: (2026)

Finding Diverse Strings and Longest Common Subsequences in a Graph
por: Shida, Yuto, et al.
Publicado: (2024)

The NFA Acceptance Hypothesis: Non-Combinatorial and Dynamic Lower Bounds
por: Bringmann, Karl, et al.
Publicado: (2023)

A closer look at TDFA
por: Borsotti, Angelo, et al.
Publicado: (2022)

Maximal Closed Substrings
por: Badkobeh, Golnaz, et al.
Publicado: (2022)

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

A Fast Algorithm for Computing Prefix Probabilities
por: Nowak, Franz, et al.
Publicado: (2023)

Generating a Gray code for prefix normal words in amortized polylogarithmic time per word
por: Burcsi, Péter, et al.
Publicado: (2020)

Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space
por: Inenaga, Shunsuke, et al.
Publicado: (2024)

Absent Subsequences in Words
por: Kosche, Maria, et al.
Publicado: (2021)

Exponent-Strings and Their Edit Distance
por: Baek, Ingyu
Publicado: (2024)

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

Efficient Matching of Some Fundamental Regular Expressions with Backreferences
por: Nogami, Taisei, et al.
Publicado: (2025)

$k$-Universality of Regular Languages Revisited
por: Adamson, Duncan, et al.
Publicado: (2025)

Algorithmical Aspects of Some Bio Inspired Operations
por: Dumitran, Marius
Publicado: (2025)

Dynamic Membership for Regular Tree Languages
por: Amarilli, Antoine, et al.
Publicado: (2025)

On Minimizers of Minimum Density
por: Shur, Arseny
Publicado: (2025)

Linear Time Subsequence and Supersequence Regex Matching
por: Amarilli, Antoine, et al.
Publicado: (2025)

Wheeler Bisimulations
por: Cotumaccio, Nicola
Publicado: (2026)

The Inverse Lyndon Array: Definition, Properties, and Linear-Time Construction
por: Negri, Pietro, et al.
Publicado: (2026)

Efficiently Finding All Minimal and Shortest Absent Subsequences in a String
por: Manea, Florin, et al.
Publicado: (2025)

Constant-Time Dynamic Enumeration of Word Infixes in a Regular Language
por: Amarilli, Antoine, et al.
Publicado: (2026)

Linear-size Suffix Tries and Linear-size CDAWGs Simplified and Improved
por: Inenaga, Shunsuke
Publicado: (2024)

Out-of-Order Membership in Regular Languages
por: Amarilli, Antoine, et al.
Publicado: (2026)

A Myhill-Nerode Theorem for Generalized Automata, with Applications to Pattern Matching and Compression
por: Cotumaccio, Nicola
Publicado: (2023)

Constant-delay enumeration for SLP-compressed documents
por: Muñoz, Martín, et al.
Publicado: (2022)

Fine-Grained Complexity of Regular Path Queries
por: Casel, Katrin, et al.
Publicado: (2021)

Data Structures for Finite Downsets of Natural Vectors: Theory and Practice
por: Cadilhac, Michaël, et al.
Publicado: (2025)

Techniques for Showing the Decidability of the Boundedness Problem of Language Acceptors
por: Ibarra, Oscar H., et al.
Publicado: (2024)

Optimal Sequential Flows
por: Gimbert, Hugo, et al.
Publicado: (2025)

Smallest Suffixient Sets: Effectiveness, Resilience, and Calculation
por: Fujimaru, Hiroto, et al.
Publicado: (2025)

Complex event recognition meets hierarchical conjunctive queries
por: Pinto, Dante, et al.
Publicado: (2024)