:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Charlier, Baudouin Le
Format:	Preprint
Published:	2025
Subjects:	Formal Languages and Automata Theory E.1; F.4; I.1
Online Access:	https://arxiv.org/abs/2509.18232
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

RE#: High Performance Derivative-Based Regex Matching with Intersection, Complement and Lookarounds
by: Varatalu, Ian Erik, et al.
Published: (2024)

From Compactifying Lambda-Letrec Terms to Recognizing Regular-Expression Processes
by: Grabmayer, Clemens
Published: (2024)

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

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

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

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

Complex Event Recognition with Symbolic Register Transducers: Extended Technical Report
by: Alevizos, Elias, et al.
Published: (2024)

AI-Oracle Machines for Intelligent Computing
by: Wang, Jie
Published: (2024)

Dynamically Reprogrammable Runtime Monitors for Bounded-time MTL
by: Hebballi, Chirantan, et al.
Published: (2026)

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

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

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

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

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

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

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

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

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

Introducing Divergence for Infinite Probabilistic Models
by: Finkel, Alain, et al.
Published: (2023)

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

Non-reducible Modal Transition Systems
by: Basile, Davide
Published: (2023)

Learning real-time one-counter automata using polynomially many queries
by: Mathew, Prince, et al.
Published: (2024)

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

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

Omega-Regular Robustness
by: Fisman, Dana, et al.
Published: (2025)

Turn Complexity of Context-free Languages, Pushdown Automata and One-Counter Automata
by: Pighizzini, Giovanni
Published: (2026)

Active Automata Learning with Advice
by: Fica, Michał, et al.
Published: (2025)

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

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

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)

Reachability for Multi-Priced Timed Automata with Positive and Negative Rates
by: Scoones, Andrew, 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)

Checking Timed Bisimilarity with Virtual Clocks
by: Lieb, Alexander, et al.
Published: (2024)

How to Demonstrate Metalinearness and Regularity by Tree-Restricted General Grammars
by: Havel, Martin, et al.
Published: (2024)

Programmable Co-Transcriptional Splicing: Realizing Regular Languages via Hairpin Deletion
by: Cho, Da-Jung, et al.
Published: (2025)

Stratifiable formulae are not context-free
by: Ryan-Smith, Calliope
Published: (2023)

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

Inquisitive Team Semantics of LTL
by: Bozzelli, Laura, et al.
Published: (2025)