Image de couverture de livre

Templated Assembly Theory: An Extension of the Canonical Assembly Index with Block-Compressed Template

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Masierak, Piotr
Format:	Preprint
Publié:	2026
Sujets:	Formal Languages and Automata Theory 68W32 (Primary) 68R15, 68R10 (Secondary) G.2; F.2.2
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Dorst-Smeulders Coding for Arbitrary Binary Words
par: De Luca, Alessandro, et autres
Publié: (2025)

Computational Complexity of Determining the Assembly Index
par: Masierak, Piotr
Publié: (2026)

Computable Bounds and Monte Carlo Estimates of the Expected Edit Distance
par: Bilardi, Gianfranco, et autres
Publié: (2022)

Computing Maximal Repeating Subsequences in a String
par: Gong, Mingyang, et autres
Publié: (2026)

On the near-tightness of $χ\leq 2r$: a general $σ$-ary construction and a binary case via LFSRs
par: Date, Vinicius T. V., et autres
Publié: (2025)

Stringological sequence prediction I: efficient algorithms for predicting highly repetitive sequences
par: Kosoy, Vanessa
Publié: (2026)

Grammar-Constrained (CFL) Reachability: Subcubic Preprocessing, Indexing Trade-offs, and Structured Decoding Semantics
par: Alpay, Faruk, et autres
Publié: (2026)

A cornering strategy for synchronizing a DFA
par: Bradshaw, Peter, et autres
Publié: (2024)

Words with factor complexity $2n+1$ and minimal critical exponent
par: Currie, James D.
Publié: (2025)

Exact Algorithms for MaxCut on Split Graphs
par: Lalovic, Marko
Publié: (2024)

The decidability of the genus of regular languages and directed emulators
par: Bonfante, Guillaume, et autres
Publié: (2021)

Tight Bounds for the Number of Absent Subsequences
par: Adamson, Duncan, et autres
Publié: (2024)

On Graph Grammars and Games
par: Vijayakumar, Jayakrishna, et autres
Publié: (2024)

A framework for distributed discrete evacuation strategies
par: Borowiecki, Piotr, et autres
Publié: (2025)

From Historical Puzzles to Grammatical Constraints: Circular Partitions, Generalized Run-Length Encodings, and Polynomial-Time Decidability
par: Khormali, Omid, et autres
Publié: (2026)

Extending the Extension: Deterministic Algorithm for Non-monotone Submodular Maximization
par: Buchbinder, Niv, et autres
Publié: (2024)

Normal forms in Virus Machines
par: Ramírez-de-Arellano, A., et autres
Publié: (2024)

Cellular Automaton Reducibility as a Measure of Complexity for Infinite Words
par: Zubia, Markel, et autres
Publié: (2026)

Boltzmann sampling and optimal exact-size sampling for directed acyclic graphs
par: Gabryelski, Wojciech, et autres
Publié: (2026)

Some Results on Digital Segments and Balanced Words
par: De Luca, Alessandro, et autres
Publié: (2022)

Inferring Input Grammars from Code with Symbolic Parsing
par: Bettscheider, Leon, et autres
Publié: (2025)

Searching in trees with monotonic query times
par: Dereniowski, Dariusz, et autres
Publié: (2024)

Improved Approximation Algorithms for Path and Forest Augmentation via a Novel Relaxation
par: Hommelsheim, Felix
Publié: (2025)

A $4/3$ Approximation for $2$-Vertex-Connectivity
par: Bosch-Calvo, Miguel, et autres
Publié: (2023)

Subword enumeration up to stack-sorting equivalence
par: Campbell, John M., et autres
Publié: (2026)

Low complexity binary words avoiding $(5/2)^+$-powers
par: Currie, James, et autres
Publié: (2025)

Computing the k-binomial complexity of generalized Thue--Morse words
par: Golafshan, M., et autres
Publié: (2024)

Mapping words to powers by morphisms
par: Saarela, Aleksi
Publié: (2025)

A Connection Between Unbordered Partial Words and Sparse Rulers
par: Saarela, Aleksi, et autres
Publié: (2024)

Mapped Exponent and Asymptotic Critical Exponent of Words
par: Foster, Eva, et autres
Publié: (2025)

Group Actions and Some Combinatorics on Words with $\mathbf{vtm}$
par: Machacek, John
Publié: (2025)

The Shortest Interesting Binary Words
par: Fici, Gabriele
Publié: (2024)

Searching by Heterogeneous Agents
par: Dereniowski, Dariusz, et autres
Publié: (2021)

A $5/4$-Approximation for Two-Edge Connectivity
par: Bosch-Calvo, Miguel, et autres
Publié: (2024)

The generating power of weighted tree automata with initial algebra semantics
par: Droste, Manfred, et autres
Publié: (2024)

Around Context-Free Grammars -- a Normal Form, a Representation Theorem, and a Regular Approximation
par: Cojocaru, Liliana
Publié: (2015)

Fully Dynamic Breadth First Search and Spanning Trees in Directed Graphs
par: Morse, Gregory, et autres
Publié: (2026)

An Explicit and Efficient $O(n^2)$-Time Algorithm for Sorting Sumsets
par: Mundhra, S.
Publié: (2025)

A Note on the Relation between Recognisable Series and Regular Sequences, and their Minimal Linear Representations
par: Heuberger, Clemens, et autres
Publié: (2022)

Restivo Salemi property for $α$-power free languages with $α\geq 5$ and $k\geq 3$ letters
par: Rukavicka, Josef
Publié: (2023)