Cover Image

Specifying and Verifying the Convergence Stairs of the Collatz Program

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Ebnenasir, Ali
Format:	Preprint
Published:	2024
Subjects:	Discrete Mathematics Data Structures and Algorithms Formal Languages and Automata Theory D.3.1; F.3.1; F.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Myhill-Nerode Type Characterization of 2detLIN Languages
by: Nagy, Benedek
Published: (2025)

Polynomial Bounds of CFLOBDDs against BDDs
by: Zhi, Xusheng, et al.
Published: (2024)

Scalable Learning of One-Counter Automata via State-Merging Algorithms
by: Guha, Shibashis, et al.
Published: (2025)

Quantitative Verification of Omega-regular Properties in Probabilistic Programming
by: Wang, Peixin, et al.
Published: (2025)

Learning real-time one-counter automata using polynomially many queries
by: Mathew, Prince, et al.
Published: (2024)

Non-reducible Modal Transition Systems
by: Basile, Davide
Published: (2023)

LR Parsing of Permutation Phrases
by: Kostičová, Jana
Published: (2024)

INTERLEAVE: A Faster Symbolic Algorithm for Maximal End Component Decomposition
by: Bansal, Suguman, et al.
Published: (2025)

Subsequence Matching and Analysis Problems for Formal Languages
by: Fazekas, Szilárd Zsolt, et al.
Published: (2024)

Probability and Angelic Nondeterminism with Multiset Semantics
by: Ong, Shawn, et al.
Published: (2024)

Construction of Minkowski Sums by Cellular Automata
by: Tahay, Pierre-Adrien
Published: (2024)

Towards Automatic Error Recovery in Parsing Expression
by: de Medeiros, Sérgio Queiroz, et al.
Published: (2025)

Bridging Chaos Game Representations and $k$-mer Frequencies of DNA Sequences
by: He, Haoze, et al.
Published: (2025)

Quantitative Assurance and Synthesis of Controllers from Activity Diagrams
by: Ye, Kangfeng, et al.
Published: (2024)

Visualising CTL Witnesses and Counterexamples -- Extended Version
by: Rensink, Arend
Published: (2026)

Learn, Check, Test -- Security Testing Using Automata Learning and Model Checking
by: Marksteiner, Stefan, et al.
Published: (2025)

Model-bounded monitoring of hybrid systems
by: Waga, Masaki, et al.
Published: (2021)

Succinctness of Cosafety Fragments of LTL via Combinatorial Proof Systems (extended version)
by: Geatti, Luca, et al.
Published: (2024)

Learning Deterministic One-Counter Automata in Polynomial Time
by: Mathew, Prince, et al.
Published: (2025)

The Chonkers Algorithm: Content-Defined Chunking with Provable Strict Guarantees on Size and Locality
by: Berger, Benjamin
Published: (2025)

Pushing the Limits: Concurrency Detection in Acyclic Sound Free-Choice Workflow Nets in $O(P^2 + T^2)$
by: Prinz, Thomas M., et al.
Published: (2024)

Difficulty Generating Factors for Context-free Language Construction Assignments
by: Schmalstieg, Florian, et al.
Published: (2025)

Dorst-Smeulders Coding for Arbitrary Binary Words
by: De Luca, Alessandro, et al.
Published: (2025)

Exploring Large Language Models for Access Control Policy Synthesis and Summarization
by: Vatsa, Adarsh, et al.
Published: (2025)

Decomposing Words for Enhanced Compression: Exploring the Number of Runs in the Extended Burrows-Wheeler Transform
by: Ingels, Florian, et al.
Published: (2025)

Satisfiability of Context-free String Constraints with Subword-ordering and Transducers
by: Aiswarya, C, et al.
Published: (2024)

Grammar-Constrained (CFL) Reachability: Subcubic Preprocessing, Indexing Trade-offs, and Structured Decoding Semantics
by: Alpay, Faruk, et al.
Published: (2026)

CBCL: Safe Self-Extending Agent Communication
by: O'Connor, Hugo
Published: (2026)

Implementation of Polynomial NP-Complete Algorithms Based on the NP Verifier Simulation Framework
by: Lee, Changryeol
Published: (2026)

Regular Expressions with Backreferences: Polynomial-Time Matching Techniques
by: Schmid, Markus L.
Published: (2019)

Regular Model Checking for Systems with Effectively Regular Reachability Relation
by: Esparza, Javier, et al.
Published: (2025)

Generalized De Bruijn Words, Invertible Necklaces, and the Burrows-Wheeler Transform
by: Fici, Gabriele, et al.
Published: (2025)

Morphisms and BWT-run Sensitivity
by: Fici, Gabriele, et al.
Published: (2025)

Unclustered BWTs of any Length over Non-Binary Alphabets
by: Fici, Gabriele, et al.
Published: (2025)

Inversion by Partial Evaluation: A Reversible Interpreter Experiment
by: Glück, Robert, et al.
Published: (2024)

Have a thing? Reasoning around recursion with dynamic typing in grounded arithmetic
by: Bobrow, Elliot, et al.
Published: (2025)

Contract-based Verification of Digital Twins
by: Naeem, Muhammad, et al.
Published: (2025)

On the probability of being synchronizable
by: Berlinkov, Mikhail V.
Published: (2013)

Inferring Input Grammars from Code with Symbolic Parsing
by: Bettscheider, Leon, et al.
Published: (2025)

Quasi-stratified Order Semantics of Concurrency
by: Koutny, Maciej, et al.
Published: (2024)