Cover Image

Binary codes that do not preserve primitivity

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Holub, Štěpán, Raška, Martin, Starosta, Štěpán
Format:	Preprint
Published:	2022
Subjects:	Formal Languages and Automata Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Finite maximal codes and factorizations of cyclic groups
by: De Felice, Clelia
Published: (2022)

CASP: An evaluation dataset for formal verification of C code
by: Hertzberg, Niclas, et al.
Published: (2025)

Efficient Runtime Verification of Real-Time Systems under Parametric Communication Delays
by: Fränzle, Martin, et al.
Published: (2024)

Closure Properties of General Grammars -- Formally Verified
by: Dvorak, Martin, et al.
Published: (2023)

Deciding whether an Attributed Translation can be realized by a Top-Down Transducer
by: Maneth, Sebastian, et al.
Published: (2023)

Attributed Tree Transducers for Partial Functions
by: Maneth, Sebastian, et al.
Published: (2024)

You May Delay, but Time Will Not: Timed Games Under Delayed Control
by: Larsen, Kim G., et al.
Published: (2025)

Input-Driven Pushdown Automata with Translucent Input Letters
by: Kutrib, Martin, et al.
Published: (2025)

Synchronization of strongly connected partial DFAs and prefix codes
by: Berlinkov, Mikhail V., et al.
Published: (2021)

Time for Timed Monitorability
by: Grosen, Thomas M., et al.
Published: (2025)

Fast and General Automatic Differentiation for Finite-State Methods
by: Yang, Lucas Ondel, et al.
Published: (2026)

History-deterministic Parikh Automata
by: Erlich, Enzo, et al.
Published: (2022)

Exploiting Assumptions for Effective Monitoring of Real-Time Properties under Partial Observability
by: Cimatti, Alessandro, et al.
Published: (2024)

Mata, a Fast and Simple Finite Automata Library (Technical Report)
by: Chocholatý, David, et al.
Published: (2023)

WEX: Formal Specifications for Windows in Stream Processing
by: Hitarth, S, et al.
Published: (2022)

Correctness Notions for Petri Nets with Identifiers
by: van der Werf, Jan Martijn E. M., et al.
Published: (2022)

Structural Reductions and Stutter Sensitive Properties
by: Paviot-Adet, Emmanuel, et al.
Published: (2022)

Constructing Concise Characteristic Samples for Acceptors of Omega Regular Languages
by: Angluin, Dana, et al.
Published: (2022)

All about unambiguous polynomial closure
by: Place, Thomas, et al.
Published: (2022)

The Power-Set Construction for Tree Algebras
by: Blumensath, Achim
Published: (2022)

Completely reachable automata: a quadratic decision algorithm and a quadratic upper bound on the reaching threshold
by: Ferens, Robert, et al.
Published: (2022)

Minimality Notions via Factorization Systems and Examples
by: Wißmann, Thorsten
Published: (2022)

Weighted Tree Automata -- May it be a little more?
by: Fülöp, Zoltán, et al.
Published: (2022)

Composing Copyless Streaming String Transducers
by: Alur, Rajeev, et al.
Published: (2022)

Waiting Nets: State Classes and Taxonomy
by: Hélouët, Loïc, et al.
Published: (2022)

A Regular and Complete Notion of Delay for Streaming String Transducers
by: Filiot, Emmanuel, et al.
Published: (2022)

Simulations for Event-Clock Automata
by: Akshay, S, et al.
Published: (2022)

Deterministic pushdown automata can compress some normal sequences
by: Carton, Olivier, et al.
Published: (2022)

Standard Automata Theory and Process Algebra
by: Yodaiken, Victor
Published: (2022)

A model of actors and grey failures
by: Bocchi, Laura, et al.
Published: (2022)

Myhill-Nerode Theorem for Higher-Dimensional Automata
by: Fahrenberg, Uli, et al.
Published: (2022)

Weighted Context-Free-Language Ordered Binary Decision Diagrams
by: Sistla, Meghana, et al.
Published: (2023)

The Expansion Problem for Infinite Trees
by: Blumensath, Achim
Published: (2023)

A General Information Extraction Framework Based on Formal Languages
by: Schmid, Markus L.
Published: (2025)

Finite Automata for Efficient Graph Recognition
by: Drewes, Frank, et al.
Published: (2024)

Statistical process discovery
by: Cry, Pierre, et al.
Published: (2025)

Reasoning about Rare-Event Reachability in Stochastic Vector Addition Systems via Affine Vector Spaces
by: Jeppson, Joshua, et al.
Published: (2025)

Hyper pattern matching
by: Waga, Masaki, et al.
Published: (2025)

MITL Model Checking via Generalized Timed Automata and a New Liveness Algorithm
by: Akshay, S., et al.
Published: (2024)

Certified Symbolic Finite Transducers: Formalization and Applications to String Analysis
by: Kan, Shuanglong, et al.
Published: (2025)