Image de couverture de livre

Finite maximal codes and factorizations of cyclic groups

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	De Felice, Clelia
Format:	Preprint
Publié:	2022
Sujets:	Formal Languages and Automata Theory
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Unveiling the connection between the Lyndon factorization and the Canonical Inverse Lyndon factorization via a border property
par: Bonizzoni, Paola, et autres
Publié: (2024)

From the Lyndon factorization to the Canonical Inverse Lyndon factorization: back and forth
par: Bonizzoni, Paola, et autres
Publié: (2024)

GrappaRE -- A Tool for Efficient Graph Recognition Based on Finite Automata and Regular Expressions
par: De Rosa, Mattia, et autres
Publié: (2025)

Approximate Problems for Finite Transducers
par: Filiot, Emmanuel, et autres
Publié: (2025)

Finite Automata for Efficient Graph Recognition
par: Drewes, Frank, et autres
Publié: (2024)

Finite-valued Streaming String Transducers
par: Filiot, Emmanuel, et autres
Publié: (2024)

Repetitive Finite Automata With Translucent Letters
par: Mráz, František, et autres
Publié: (2024)

Descriptional Complexity of Finite Automata -- Selected Highlights
par: Salomaa, Arto, et autres
Publié: (2023)

Binary codes that do not preserve primitivity
par: Holub, Štěpán, et autres
Publié: (2022)

Measure Many Quantum Finite Automata on Infinite Words
par: Midya, Abhisek, et autres
Publié: (2026)

Fast and General Automatic Differentiation for Finite-State Methods
par: Yang, Lucas Ondel, et autres
Publié: (2026)

Efficient Constructions of Finite-State Independent Normal Pairs
par: Pulari, Subin
Publié: (2026)

Certified Symbolic Finite Transducers: Formalization and Applications to String Analysis
par: Kan, Shuanglong, et autres
Publié: (2025)

Optimal Approximate Minimization of One-Letter Weighted Finite Automata
par: Lacroce, Clara, et autres
Publié: (2023)

CASP: An evaluation dataset for formal verification of C code
par: Hertzberg, Niclas, et autres
Publié: (2025)

Reversible Weighted Automata over Finite Rings and Monoids with Commuting Idempotents
par: Kostolányi, Peter, et autres
Publié: (2026)

Mata, a Fast and Simple Finite Automata Library (Technical Report)
par: Chocholatý, David, et autres
Publié: (2023)

Active Inference of Extended Finite State Machine Models with Registers and Guards
par: Groz, Roland, et autres
Publié: (2026)

The Quadratic State Cost of Classical Simulation of One-Way Quantum Finite Automata
par: Chen, Zeyu, et autres
Publié: (2026)

Distributional Learning of Context-Free Languages under Fixed Finite-Monoid Typing
par: Kuriyama, Takayuki
Publié: (2014)

Generalised Arc Consistency via the Synchronised Product of Finite Automata wrt a Constraint
par: Beldiceanu, Nicolas
Publié: (2025)

A Probabilistic Model-Checking Framework for Cognitive Assessment and Training
par: De Maria, Elisabetta, et autres
Publié: (2026)

Tokenization as Finite-State Transduction
par: Cognetta, Marco, et autres
Publié: (2024)

Locality Testing for NFAs is PSPACE-complete
par: Amarilli, Antoine, et autres
Publié: (2025)

Hyper-Minimization for Deterministic Register Automata
par: Li, Yong, et autres
Publié: (2026)

Multihead Finite-State Compression
par: Lutz, Neil
Publié: (2025)

Synchronization of strongly connected partial DFAs and prefix codes
par: Berlinkov, Mikhail V., et autres
Publié: (2021)

Resolving Nondeterminism by Chance
par: Paul, Soumyajit, et autres
Publié: (2025)

Comparing Spoken Languages using Paninian System of Sounds and Finite State Machines
par: Prabhu, Shreekanth M, et autres
Publié: (2023)

On linguistic subsets of groups and monoids
par: Carvalho, André, et autres
Publié: (2025)

Geodesic languages for rational subsets and conjugates in virtually free groups
par: Carvalho, André, et autres
Publié: (2024)

Finite Automata Encoding Piecewise Polynomials
par: Berdinsky, Dmitry, et autres
Publié: (2021)

On the Simulation Cost of Quantum Finite Automata
par: Chen, Zeyu, et autres
Publié: (2026)

Modular Decomposition of Hierarchical Finite State Machines
par: Biggar, Oliver, et autres
Publié: (2021)

Complexity of Unary Exclusive Nondeterministic Finite Automata
par: Kutrib, Martin, et autres
Publié: (2024)

WEX: Formal Specifications for Windows in Stream Processing
par: Hitarth, S, et autres
Publié: (2022)

Correctness Notions for Petri Nets with Identifiers
par: van der Werf, Jan Martijn E. M., et autres
Publié: (2022)

Structural Reductions and Stutter Sensitive Properties
par: Paviot-Adet, Emmanuel, et autres
Publié: (2022)

Constructing Concise Characteristic Samples for Acceptors of Omega Regular Languages
par: Angluin, Dana, et autres
Publié: (2022)

History-deterministic Parikh Automata
par: Erlich, Enzo, et autres
Publié: (2022)