:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Wißmann, Thorsten
Format:	Preprint
Published:	2022
Subjects:	Formal Languages and Automata Theory
Online Access:	https://arxiv.org/abs/2202.05701
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Formalized Run-Time Analysis of Active Learning -- Coalgebraically in Agda
by: Wißmann, Thorsten
Published: (2026)

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

Algebraic Language Theory with Effects
by: Lenke, Fabian, et al.
Published: (2024)

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

Constructing Deterministic Parity Automata from Positive and Negative Examples
by: Bohn, León, et al.
Published: (2023)

A New Notion of Regularity: Finite State Automata Accepting Graphs
by: Meeres, Yvo Ad
Published: (2024)

Hyper-Minimization for Deterministic Register Automata
by: Li, Yong, et al.
Published: (2026)

Minimizing Streaming String Transducers: An algebraic approach
by: Benalioua, Yahia Idriss, et al.
Published: (2026)

Minimizing Cost Register Automata over a Field
by: Benalioua, Yahia Idriss, et al.
Published: (2023)

Optimal Approximate Minimization of One-Letter Weighted Finite Automata
by: Lacroce, Clara, et al.
Published: (2023)

A Factorization Theorem for Forest Algebras
by: Almagor, Shaull, et al.
Published: (2026)

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

History-Constrained Systems
by: Kuijer, Louwe B., et al.
Published: (2026)

Reachability in Trace-Pushdown Systems
by: Köcher, Chris, et al.
Published: (2025)

Responsibility in Actor-Based Systems
by: Baier, Christel, et al.
Published: (2024)

Forbidden-Context & Ordered Grammar Systems
by: Fernau, Henning, et al.
Published: (2026)

Box-Reachability in Vector Addition Systems
by: Almagor, Shaull, et al.
Published: (2025)

Mining Diamonds in labeled Transition Systems
by: van Spaendonck, P. H. M., et al.
Published: (2025)

Weighted Automata and Regular Expressions for Financial Systems
by: Droste, Manfred, et al.
Published: (2026)

Backward Responsibility in Transition Systems Beyond Safety
by: Baier, Christel, et al.
Published: (2025)

Compositional Abstraction for Timed Systems with Broadcast Synchronization
by: Chen, Hanyue, et al.
Published: (2025)

Componentwise Automata Learning for System Integration (Extended Version)
by: Fujinami, Hiroya, et al.
Published: (2025)

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

Systems of Graph Formulas and their Equivalence to Alternating Graph Automata
by: Drewes, Frank, et al.
Published: (2025)

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

Reachability in One-Dimensional Pushdown Vector Addition Systems is Decidable
by: Bizière, Clotilde, et al.
Published: (2024)

Parameterized Verification of Systems with Precise (0,1)-Counter Abstraction
by: Eichler, Paul, et al.
Published: (2024)

More on Maximally Permissive Similarity Control of Discrete Event Systems
by: Wang, Yu, et al.
Published: (2024)

Backward Responsibility in Transition Systems Using General Power Indices
by: Baier, Christel, et al.
Published: (2024)

Jumbled Scattered Factors
by: Fleischmann, Pamela, et al.
Published: (2025)

Exact Separation of Words via Trace Geometry
by: Chen, Zeyu, et al.
Published: (2026)

Extended Stone Duality via Monoidal Adjunctions
by: Lenke, Fabian, et al.
Published: (2024)

Distributional Learning of Graph Languages Generated by Fixed-Interface Clause Systems
by: Shoudai, Takayoshi, et al.
Published: (2026)

Model Checking for Multi-Agent Systems Modeled By Epistemic Process Calculus
by: Yu, Qixian, et al.
Published: (2025)

Black-box Testing Liveness Properties of Partially Observable Stochastic Systems
by: Esparza, Javier, et al.
Published: (2023)

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

A Unified Model for Real-Time Systems: Symbolic Techniques and Implementation
by: Akshay, S, et al.
Published: (2023)

Review of Automaton Learning Algorithms with Polynomial Complexity -- Completely Solved Examples
by: Haneef, Farah
Published: (2024)

Characterizing normality via automata and random matrix products
by: Bienvenu, Laurent, 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)