:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Cho, Da-Jung, Fazekas, Szilárd Zsolt, Seki, Shinnosuke, Wiedenhöft, Max
Format:	Preprint
Published:	2025
Subjects:	Formal Languages and Automata Theory 92-10 F.4.3; J.3; F.1.3
Online Access:	https://arxiv.org/abs/2506.23384
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Formalization of Co-Transcriptional Splicing as an Operation on Formal Languages
by: Cho, Da-Jung, et al.
Published: (2025)

Generalized Parikh Matrices For Tracking Subsequence Occurrences
by: Fazekas, Szilárd Zsolt, et al.
Published: (2024)

Jump Complexity of Deterministic Finite Automata with Translucent Letters
by: Fazekas, Szilárd Zsolt, et al.
Published: (2025)

The Equivalence Problem of E-Pattern Languages with Regular Constraints is Undecidable
by: Nowotka, Dirk, et al.
Published: (2024)

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

Subsequence Matching and Analysis Problems for Formal Languages
by: Fazekas, Szilárd Zsolt, et al.
Published: (2024)

The Equivalence Problem of E-Pattern Languages with Length Constraints is Undecidable
by: Nowotka, Dirk, et al.
Published: (2024)

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

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

Minimal History-Deterministic Co-Buchi Automata: Congruences and Passive Learning
by: Löding, Christof, et al.
Published: (2025)

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

Regular Model Checking for Systems with Effectively Regular Reachability Relation
by: Esparza, Javier, et al.
Published: (2025)

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)

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

Characterizing NC1 with Typed Monoids
by: Dawar, Anuj, et al.
Published: (2025)

An Analysis of Decision Problems for Relational Pattern Languages under Various Constraints
by: Jansen, Klaus, et al.
Published: (2025)

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

Commuting upper triangular binary morphisms
by: Honkala, Juha
Published: (2023)

Active Learning Techniques for Pomset Recognizers
by: Pommellet, Adrien, et al.
Published: (2025)

A Robust Measure on FDFAs Following Duo-Normalized Acceptance
by: Fisman, Dana, et al.
Published: (2023)

Store Languages of Turing Machines and Counter Machines
by: Friesen, Noah, et al.
Published: (2025)

Active Learning of Upward-Closed Sets of Words
by: Aristote, Quentin
Published: (2025)

Deciding DFA-Primality is NP-Hard
by: Spenner, Daniel Alexander
Published: (2026)

Planning with Probabilistic Opacity and Transparency: A Computational Model of Opaque/Transparent Observations
by: Udupa, Sumukha, et al.
Published: (2024)

Verifying Unboundedness via Amalgamation
by: Anand, Ashwani, et al.
Published: (2024)

Runtime Consultants
by: Fisman, Dana, et al.
Published: (2025)

Learning Realtime One-Counter Automata
by: Bruyère, Véronique, et al.
Published: (2021)

On History-Deterministic One-Counter Nets
by: Prakash, Keya, et al.
Published: (2022)

Monads, Comonads, and Transducers
by: Stefański, Rafał
Published: (2024)

Automata with Timers
by: Bruyère, Véronique, et al.
Published: (2023)

A Myhill-Nerode style Characterization for Timed Automata With Integer Resets
by: Doveri, Kyveli, et al.
Published: (2024)

Normal Forms for Elements of ${}^*$-Continuous Kleene Algebras Representing the Context-Free Languages
by: Hopkins, Mark, et al.
Published: (2023)

A Myhill-Nerode Type Characterization of 2detLIN Languages
by: Nagy, Benedek
Published: (2025)

Parsing Hypergraphs using Context-Free Positional Grammars
by: Costagliola, Gennaro, et al.
Published: (2026)

Various Types of Comet Languages and their Application in External Contextual Grammars
by: Ködding, Marvin, et al.
Published: (2024)

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

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

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

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