:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Lieb, Alexander, Göttmann, Hendrik, Luthmann, Lars, Lochau, Malte, Schürr, Andy
Format:	Preprint
Published:	2024
Subjects:	Formal Languages and Automata Theory F.1.1
Online Access:	https://arxiv.org/abs/2412.15799
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Reachability for Multi-Priced Timed Automata with Positive and Negative Rates
by: Scoones, Andrew, et al.
Published: (2024)

Deterministic Suffix-reading Automata
by: Keerthan, R, et al.
Published: (2024)

Separability in Büchi Vass and Singly Non-Linear Systems of Inequalities
by: Baumann, Pascal, et al.
Published: (2024)

Equivalence of Deterministic Weighted Real-time One-Counter Automata
by: Mathew, Prince, et al.
Published: (2024)

Flattability of Priority Vector Addition Systems
by: Guttenberg, Roland
Published: (2024)

Exploring VASS Parameterised by Geometric Dimension
by: Czerwiński, Wojciech, et al.
Published: (2026)

On Constructing Finite Automata by Relational Programming
by: Egri-Nagy, Attila, et al.
Published: (2025)

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

On Direct Product and Quotient of Strongly Connected Automata
by: Hu, Zino H.
Published: (2011)

A Uniform Framework for Problems on Context-Free Grammars
by: Esparza, Javier, et al.
Published: (2024)

On the Boolean Closure of Deterministic Top-Down Tree Automata
by: Löding, Christof, et al.
Published: (2024)

Probabilistic Finite Automaton Emptiness is undecidable
by: Rote, Günter
Published: (2024)

Probabilistic Finite Automaton Emptiness is Undecidable for a Fixed Automaton
by: Rote, Günter
Published: (2024)

On Repetitive Finite Automata with Translucent Words
by: Mráz, František, et al.
Published: (2025)

On Minimization and Learning of Deterministic $ω$-Automata in the Presence of Don't Care Words
by: Löding, Christof, et al.
Published: (2022)

Recognizing Numbers
by: Gaba, Pranshu, et al.
Published: (2025)

Lexicographic transductions of finite words
by: Filiot, Emmanuel, et al.
Published: (2025)

Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata
by: Bojańczyk, Mikołaj, et al.
Published: (2021)

Edit Distance of Finite State Transducers
by: Aiswarya, C., et al.
Published: (2024)

Exploring Complexity: An Extended Study of Formal Properties for Process Model Complexity Measures
by: Schalk, Patrizia, et al.
Published: (2024)

Edit Distance of Finite-Valued Transducers
by: Mathew, Prince, et al.
Published: (2026)

Deterministic Suffix-reading Automata
by: Keerthan, R, et al.
Published: (2025)

PVASS Reachability is Decidable
by: Guttenberg, Roland, et al.
Published: (2025)

List of Results on the Černý Conjecture and Reset Thresholds for Synchronizing Automata
by: Volkov, Mikhail V.
Published: (2025)

Learning Tree Automata with Term Rewriting
by: Kopystiański, Jakub, et al.
Published: (2026)

Reachability and Related Problems in Vector Addition Systems with Nested Zero Tests
by: Guttenberg, Roland, et al.
Published: (2025)

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

Input-Erasing Two-Way Finite Automata
by: Meduna, Alexander, et al.
Published: (2025)

Parameterized Verification of Timed Networks with Clock Invariants
by: André, Étienne, et al.
Published: (2024)

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

Identity Testing for Stochastic Languages
by: Agarwal, Smayan, et al.
Published: (2025)

On Transition Constructions for Automata -- A Categorical Perspective
by: Cruchten, Mike
Published: (2024)

Kleene Theorems for Lasso Languages and $ω$-Languages
by: Cruchten, Mike
Published: (2024)

Finitely Presentable Higher-Dimensional Automata and the Irrationality of Process Replication
by: Basold, Henning, et al.
Published: (2023)

Polynomial Complementation of Nondeterministic 2-Way Finite Automata by 1-Limited Automata
by: Guillon, Bruno, et al.
Published: (2025)

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

A Decision Procedure for Probabilistic Kleene Algebra with Angelic Nondeterminism
by: Ong, Shawn, et al.
Published: (2025)

Decidability Issues for Petri Nets -- a survey
by: Esparza, Javier, et al.
Published: (2024)

Composition Machines: Programming Self-Organising Software Models for the Emergence of Sequential Program Spaces
by: Arellanes, Damian
Published: (2021)

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