:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteur principal:	S, Akhil
Format:	Preprint
Publié:	2025
Sujets:	Information Theory 68P30 68Q45
Accès en ligne:	https://arxiv.org/abs/2502.06208
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Generalized Samorodnitsky noisy function inequalities, with applications to error-correcting codes
par: Abawonse, Olakunle S., et autres
Publié: (2025)

Generalized Word-Representable Graphs
par: Feng, Zhidan, et autres
Publié: (2024)

On Quantum Context-Free Grammars
par: Aruja, Merina, et autres
Publié: (2025)

Weighing Obese Timed Languages
par: Asarin, Eugene, et autres
Publié: (2025)

Computing the Bandwidth of Meager Timed Automata
par: Asarin, Eugene, et autres
Publié: (2024)

On the Intersection Problem for Quantum Finite Automata
par: Benso, Andrea, et autres
Publié: (2024)

Conditional normality and finite-state dimensions revisited
par: Shen, Alexander
Publié: (2024)

Heart Disease Detection using Quantum Computing and Partitioned Random Forest Methods
par: Heidari, Hanif, et autres
Publié: (2022)

Certified Finite-State Induction for a Perturbed Hofstadter Recursion
par: Mantovanelli, Marco
Publié: (2026)

Bandwidth of Nondeterministic Finite Automata
par: Cho, Da-Jung, et autres
Publié: (2026)

A Unary-to-Nonunary Transition in the Accepting-State Spectrum of Right Quotient for Permutation Automata
par: German, Samuel
Publié: (2026)

New Linear Codes from Matrix-Product Codes with Polynomial Units
par: Hernando, Fernando, et autres
Publié: (2009)

Separate Before You Compress: The WWHO Tokenization Architecture
par: Darshana, Kusal
Publié: (2026)

Semidirect Product Decompositions for Periodic Regular Languages
par: Inoue, Yusuke, et autres
Publié: (2024)

Pre-Asymptotic Trainability in Photonic Variational Circuits under Postselection
par: Xie, Yichen, et autres
Publié: (2026)

Fast Algorithms for the Computation of the Minimum Distance of a Random Linear Code
par: Hernando, Fernando, et autres
Publié: (2016)

Languages given by Finite Automata over the Unary Alphabet
par: Czerwiński, Wojciech, et autres
Publié: (2023)

Rational Functions on the Projective Line from a Computational Viewpoint
par: Badr, Eslam, et autres
Publié: (2025)

Classically Time-Controlled Quantum Automata: Definition and Properties
par: Díaz-Caro, Alejandro, et autres
Publié: (2018)

Two Problems on Quantum Computing in Finite Abelian Groups
par: Pastor-Díaz, Ulises, et autres
Publié: (2026)

Residual-Entropy Accounting for Routed Atom-Budgeted Learned Indexes
par: Alpay, Faruk, et autres
Publié: (2026)

On Unique Error Patterns in the Levenshtein's Sequence Reconstruction Model
par: Junnila, Ville, et autres
Publié: (2024)

The Optimality of a Nested Generalized Pairwise Group Testing Procedure
par: Malinovsky, Yaakov, et autres
Publié: (2025)

A novel approach to multi-image quantum encryption/decryption using qudits
par: Levaillant, Claire
Publié: (2025)

Resource bounded Kučera-Gács Theorems
par: Nandakumar, Satyadev, et autres
Publié: (2026)

Illustrating Finite Automata with Grail+ and TikZ
par: May, Alastair, et autres
Publié: (2024)

Implementing Basic Arithmetic in $\mathbb{F}_p$ via $\mathbb{F}_2$, and Its Application for Computing the Hamming Distance of Linear Codes
par: Hernando, Fernando, et autres
Publié: (2026)

Languages of Words of Low Automatic Complexity Are Hard to Compute
par: Chen, Joey, et autres
Publié: (2025)

Levenshtein's Sequence Reconstruction Problem and Results for Larger Alphabet Sizes
par: Junnila, Ville, et autres
Publié: (2025)

Bishop's (up)crossing inequality and lower semicomputable random reals revisited
par: Andreev, Mikhail, et autres
Publié: (2025)

Point-to-set Principle and Constructive Dimension Faithfulness
par: Nandakumar, Satyadev, et autres
Publié: (2024)

On A. V. Anisimov's problem for finding a polynomial algorithm checking inclusion of context-free languages in group languages
par: Yordzhev, Krasimir
Publié: (2026)

Quantum Query Complexity of the Hyperoctahedral Group
par: Bae, Ji Ho
Publié: (2026)

Multimodal Structure-Aware Quantum Data Processing
par: Hawashin, Hala, et autres
Publié: (2024)

Simplicity and irreducibility in circular automata
par: Venturi, Riccardo
Publié: (2025)

All Kolmogorov complexity functions are optimal, but are some more optimal?
par: Bauwens, Bruno, et autres
Publié: (2025)

Current-State Opacity in Safe Partially Observed Quantum Petri Nets: True-Concurrency Semantics and Exact Symbolic Verification
par: Ding, Sichen, et autres
Publié: (2026)

A generalization of Deterministic Finite Automata related to discharging
par: Campbell, John M.
Publié: (2025)

Perfectly-Private Analog Secure Aggregation in Federated Learning
par: Jaramillo-Velez, Delio, et autres
Publié: (2025)

Amortized Locally Decodable Codes for Insertions and Deletions
par: Blocki, Jeremiah, et autres
Publié: (2025)