Image de couverture de livre

Exploring Complexity: An Extended Study of Formal Properties for Process Model Complexity Measures

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Schalk, Patrizia, Burke, Adam, Lorenz, Robert
Format:	Preprint
Publié:	2024
Sujets:	Formal Languages and Automata Theory F.4.3; H.1.1
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

On Repetitive Finite Automata with Translucent Words
par: Mráz, František, et autres
Publié: (2025)

On the Boolean Closure of Deterministic Top-Down Tree Automata
par: Löding, Christof, et autres
Publié: (2024)

On Minimization and Learning of Deterministic $ω$-Automata in the Presence of Don't Care Words
par: Löding, Christof, et autres
Publié: (2022)

Recognizing Numbers
par: Gaba, Pranshu, et autres
Publié: (2025)

Lexicographic transductions of finite words
par: Filiot, Emmanuel, et autres
Publié: (2025)

Probabilistic Finite Automaton Emptiness is undecidable
par: Rote, Günter
Publié: (2024)

Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata
par: Bojańczyk, Mikołaj, et autres
Publié: (2021)

Probabilistic Finite Automaton Emptiness is Undecidable for a Fixed Automaton
par: Rote, Günter
Publié: (2024)

Turn Complexity of Context-free Languages, Pushdown Automata and One-Counter Automata
par: Pighizzini, Giovanni
Publié: (2026)

Geometric Characterization of Context-Free Intersections via the Inner Segment Dichotomy
par: Silva, Jorge Miguel
Publié: (2026)

Complex Event Recognition with Symbolic Register Transducers: Extended Technical Report
par: Alevizos, Elias, et autres
Publié: (2024)

Identity Testing for Stochastic Languages
par: Agarwal, Smayan, et autres
Publié: (2025)

Finitely Presentable Higher-Dimensional Automata and the Irrationality of Process Replication
par: Basold, Henning, et autres
Publié: (2023)

On Transition Constructions for Automata -- A Categorical Perspective
par: Cruchten, Mike
Publié: (2024)

Polynomial Complementation of Nondeterministic 2-Way Finite Automata by 1-Limited Automata
par: Guillon, Bruno, et autres
Publié: (2025)

How Concise are Chains of co-Büchi Automata?
par: Ehlers, Rüdiger
Publié: (2025)

Kleene Theorems for Lasso Languages and $ω$-Languages
par: Cruchten, Mike
Publié: (2024)

Input-Erasing Two-Way Finite Automata
par: Meduna, Alexander, et autres
Publié: (2025)

A Decision Procedure for Probabilistic Kleene Algebra with Angelic Nondeterminism
par: Ong, Shawn, et autres
Publié: (2025)

Regular Expressions with Backreferences: Polynomial-Time Matching Techniques
par: Schmid, Markus L.
Publié: (2019)

Introducing Divergence for Infinite Probabilistic Models
par: Finkel, Alain, et autres
Publié: (2023)

On some Classes of Reversible 2-head Automata
par: Nagy, Benedek, et autres
Publié: (2025)

Non-reducible Modal Transition Systems
par: Basile, Davide
Publié: (2023)

Learning real-time one-counter automata using polynomially many queries
par: Mathew, Prince, et autres
Publié: (2024)

Orbit-finite linear programming
par: Ghosh, Arka, et autres
Publié: (2023)

A Nivat Theorem for Weighted Alternating Automata over Commutative Semirings
par: Grabolle, Gustav
Publié: (2022)

A Robust Measure on FDFAs Following Duo-Normalized Acceptance
par: Fisman, Dana, et autres
Publié: (2023)

RE#: High Performance Derivative-Based Regex Matching with Intersection, Complement and Lookarounds
par: Varatalu, Ian Erik, et autres
Publié: (2024)

The Inclusion Depth of Pattern Languages: An Open Problem in Algorithmic Learning Theory
par: Luo, Wei
Publié: (2026)

Orchestration of Music by Grammar Systems
par: Makiš, Jozef, et autres
Publié: (2025)

Algebraic Language Theory with Effects
par: Lenke, Fabian, et autres
Publié: (2024)

Commuting upper triangular binary morphisms
par: Honkala, Juha
Publié: (2023)

Active Learning Techniques for Pomset Recognizers
par: Pommellet, Adrien, et autres
Publié: (2025)

Minimal History-Deterministic Co-Buchi Automata: Congruences and Passive Learning
par: Löding, Christof, et autres
Publié: (2025)

Store Languages of Turing Machines and Counter Machines
par: Friesen, Noah, et autres
Publié: (2025)

Active Learning of Upward-Closed Sets of Words
par: Aristote, Quentin
Publié: (2025)

Deciding DFA-Primality is NP-Hard
par: Spenner, Daniel Alexander
Publié: (2026)

Planning with Probabilistic Opacity and Transparency: A Computational Model of Opaque/Transparent Observations
par: Udupa, Sumukha, et autres
Publié: (2024)

Verifying Unboundedness via Amalgamation
par: Anand, Ashwani, et autres
Publié: (2024)

Omega-Regular Robustness
par: Fisman, Dana, et autres
Publié: (2025)