:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Hélouët, Loïc, Agrawal, Pranay
Format:	Preprint
Published:	2022
Subjects:	Formal Languages and Automata Theory
Online Access:	https://arxiv.org/abs/2211.10540
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Semiflows, Home Spaces, and Home States, Applications to the Analysis of Parameterized Petri Nets
by: Memmi, Gerard
Published: (2025)

Reversible Transducers over Infinite Words
by: Dartois, Luc, et al.
Published: (2024)

Synthesizing Petri Nets from Labelled Petri Nets using Token Trail Regions
by: Bergenthum, Robin, et al.
Published: (2026)

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

Two-Way One-Counter Nets Revisited
by: Almagor, Shaull, et al.
Published: (2024)

Invariants and Home Spaces in Transition Systems and Petri Nets
by: Memmi, Gerard
Published: (2023)

Well-Formed Free-Choice Petri Nets Revisited
by: Jancar, Petr, et al.
Published: (2026)

Collaboration Miner: Discovering Collaboration Petri Nets (Extended Version)
by: Benzin, Janik-Vasily, et al.
Published: (2024)

Efficient Construction of Reachability Graphs for Petri Net Product Lines
by: Gómez-Martínez, Elena, et al.
Published: (2026)

Operational State Complexity of Block Languages
by: Duarte, Guilherme, et al.
Published: (2024)

On the Representation and State Complexity of Block Languages
by: Duarte, Guilherme, et al.
Published: (2024)

Exact Accepting-State Spectrum for Reversal of Permutation Automata
by: German, Samuel
Published: (2026)

Languages of Boundedly-Ambiguous Vector Addition Systems with States
by: Czerwiński, Wojciech, et al.
Published: (2025)

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

Efficient Constructions of Finite-State Independent Normal Pairs
by: Pulari, Subin
Published: (2026)

Active Inference of Extended Finite State Machine Models with Registers and Guards
by: Groz, Roland, et al.
Published: (2026)

State estimation of timed automata under partial observation [Draft version]
by: Gao, Chao, et al.
Published: (2024)

Verification and Enforcement of Strong State-Based Opacity for Discrete-Event Systems
by: Han, Xiaoguang, et al.
Published: (2024)

The Quadratic State Cost of Classical Simulation of One-Way Quantum Finite Automata
by: Chen, Zeyu, et al.
Published: (2026)

Synthesis of State-Attack Strategies for Anonymity and Opacity Violation in Discrete Event Systems
by: Li, Xiaoyan, et al.
Published: (2025)

CIR+CVN: Bridging LLM Semantic Understanding and Petri-Net Verification for Concurrent Programs
by: Zhang, Kaiwen, et al.
Published: (2026)

Attractor Basins in Concurrent Systems
by: Samboni, Giann Karlo Aguirre, et al.
Published: (2024)

Tokenization as Finite-State Transduction
by: Cognetta, Marco, et al.
Published: (2024)

Secret Protection in Labeled Petri Nets
by: Haar, Stefan, et al.
Published: (2025)

Persistent Permutability in Choice Petri Nets
by: Best, Eike, et al.
Published: (2026)

Multihead Finite-State Compression
by: Lutz, Neil
Published: (2025)

Characterizing Implementability of Global Protocols with Infinite States and Data
by: Li, Elaine, et al.
Published: (2024)

Regular Expression Denial of Service Induced by Backreferences
by: Liu, Yichen, et al.
Published: (2026)

Comparing Spoken Languages using Paninian System of Sounds and Finite State Machines
by: Prabhu, Shreekanth M, et al.
Published: (2023)

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

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

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

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

History-deterministic Parikh Automata
by: Erlich, Enzo, 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)