:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Šedý, Michal, Holík, Lukáš
Format:	Preprint
Published:	2024
Subjects:	Formal Languages and Automata Theory Networking and Internet Architecture
Online Access:	https://arxiv.org/abs/2410.20227
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

It Takes a Village: Bridging the Gaps between Current and Formal Specifications for Protocols
by: Basin, David, et al.
Published: (2025)

Executable QR codes with Machine Learning for Industrial Applications
by: Scanzio, Stefano, et al.
Published: (2024)

Tracer: A Tool for Race Detection in Software Defined Network Models
by: Caltais, Georgiana, et al.
Published: (2024)

Formally Discovering and Reproducing Network Protocols Vulnerabilities
by: Crochet, Christophe, et al.
Published: (2025)

NetAgentBench: A State-Centric Benchmark for Evaluating Agentic Network Configuration
by: Twabi, Ahmed, et al.
Published: (2026)

Proving DNSSEC Correctness: A Formal Approach to Secure Domain Name Resolution
by: Zhang, Qifan, et al.
Published: (2025)

String Solving with Stabilization and Transducers (Technical Report)
by: Chocholatý, David, et al.
Published: (2026)

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

On Complementation of Nondeterministic Finite Automata without Full Determinization (Technical Report)
by: Holík, Lukáš, et al.
Published: (2025)

Towards Efficient Matching of Regexes with Backreferences using Register Set Automata (Technical Report)
by: Havlena, Vojtěch, et al.
Published: (2022)

Negated String Containment is Decidable (Technical Report)
by: Havlena, Vojtěch, et al.
Published: (2025)

Automated Formal Verification of a Highly-Configurable Register Generator
by: Zhang, Shuhang, et al.
Published: (2024)

In-Memory Sorting-Searching with Cayley Tree
by: Paul, Subrata, et al.
Published: (2025)

DRAMPyML: A Formal Description of DRAM Protocols with Timed Petri Nets
by: Christ, Derek, et al.
Published: (2026)

Combinatorics of nondeterministic walks
by: de Panafieu, Élie, et al.
Published: (2023)

A Uniform Framework for Handling Position Constraints in String Solving (Technical Report)
by: Chen, Yu-Fang, et al.
Published: (2025)

Mathematical Approach in Automata and Automata Association
by: Maciel, Sergio Henrique
Published: (2020)

Verifying Quantum Circuits with Level-Synchronized Tree Automata (Technical Report)
by: Abdulla, Parosh Aziz, et al.
Published: (2024)

On Shuffling and Splitting Automata
by: Cunningham, Ignacio Mollo
Published: (2024)

Explorable Parity Automata
by: Hazard, Emile, et al.
Published: (2024)

Automata on Graph Alphabets
by: Bazille, Hugo, et al.
Published: (2026)

Quantitative Language Automata
by: Henzinger, Thomas A., et al.
Published: (2025)

Asynchronism in Cellular Automata
by: Gautam, Virendra Kumar
Published: (2025)

Pumping-Like Results for Copyless Cost Register Automata and Polynomially Ambiguous Weighted Automata
by: Mazowiecki, Filip, et al.
Published: (2025)

Determinism in Multi-Soliton Automata
by: Bordihn, Henning, et al.
Published: (2024)

Localising Stochasticity in Weighted Automata
by: Agarwal, Smayan, et al.
Published: (2026)

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

Saturation Problems for Families of Automata
by: Bohn, León, et al.
Published: (2025)

Nominal Automata with Name Deallocation
by: Prucker, Simon, et al.
Published: (2026)

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

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

QuAK: Quantitative Automata Kit
by: Chalupa, Marek, et al.
Published: (2024)

Classifying Words with 3-sort Automata
by: Jastrząb, Tomasz, et al.
Published: (2024)

Query Learning of Advice and Nominal Automata
by: Zhou, Kevin
Published: (2024)

Global One-Counter Tree Automata
by: Herrmann, Luisa, et al.
Published: (2024)

Non-Global Parikh Tree Automata
by: Herrmann, Luisa, et al.
Published: (2024)

Repetitive Finite Automata With Translucent Letters
by: Mráz, František, et al.
Published: (2024)

Completely Reachable Almost Group Automata
by: Torres, David Fernando Casas
Published: (2024)

Universality Frontier for Asynchronous Cellular Automata
by: Baburin, Ivan, et al.
Published: (2025)

History-Deterministic Büchi Automata are Succinct
by: Casares, Antonio, et al.
Published: (2026)