Image de couverture de livre

Regular Languages in the Sliding Window Model

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Ganardi, Moses, Hucke, Danny, Lohrey, Markus, Mamouras, Konstantinos, Starikovskaya, Tatiana
Format:	Preprint
Publié:	2024
Sujets:	Formal Languages and Automata Theory
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

On the complexity of computing Strahler numbers
par: Ganardi, Moses, et autres
Publié: (2025)

Directed Regular and Context-Free Languages
par: Ganardi, Moses, et autres
Publié: (2024)

MSO-Enumeration Over SLP-Compressed Unranked Forests
par: Lohrey, Markus, et autres
Publié: (2024)

Existential Definability over the Subword Ordering
par: Baumann, Pascal, et autres
Publié: (2022)

Fast Ramsey Quantifier Elimination in LIRA (with applications to liveness checking)
par: Lichtner, Kilian, et autres
Publié: (2025)

Shuffles of Context-Free Languages along Regular Trajectories
par: Barloy, Corentin, et autres
Publié: (2026)

On the Complexity of Computing the Co-lexicographic Width of a Regular Language
par: Becker, Ruben, et autres
Publié: (2024)

Constructing Concise Characteristic Samples for Acceptors of Omega Regular Languages
par: Angluin, Dana, et autres
Publié: (2022)

WEX: Formal Specifications for Windows in Stream Processing
par: Hitarth, S, et autres
Publié: (2022)

A General Information Extraction Framework Based on Formal Languages
par: Schmid, Markus L.
Publié: (2025)

Regular Expressions with Backreferences on Multiple Context-Free Languages, and the Closed-Star Condition
par: Nogami, Taisei, et autres
Publié: (2024)

On the Expressive Power of Regular Expressions with Backreferences
par: Nogami, Taisei, et autres
Publié: (2023)

Weighted Automata and Regular Expressions for Financial Systems
par: Droste, Manfred, et autres
Publié: (2026)

Regular Grammars for Sets of Graphs of Tree-Width 2
par: Bozga, Marius, et autres
Publié: (2024)

Well-Behaved (Co)algebraic Semantics of Regular Expressions in Dafny
par: Zetzsche, Stefan, et autres
Publié: (2024)

A Regular and Complete Notion of Delay for Streaming String Transducers
par: Filiot, Emmanuel, et autres
Publié: (2022)

GrappaRE -- A Tool for Efficient Graph Recognition Based on Finite Automata and Regular Expressions
par: De Rosa, Mattia, et autres
Publié: (2025)

Scalable Tree-based Register Automata Learning
par: Dierl, Simon, et autres
Publié: (2024)

Compiling Quantum Regular Language States
par: Bellante, Armando, et autres
Publié: (2026)

Refl-Spanners: A Purely Regular Approach to Non-Regular Core Spanners
par: Schmid, Markus L., et autres
Publié: (2020)

Universally Wheeler Languages
par: Becker, Ruben, et autres
Publié: (2025)

Quantitative Language Automata
par: Henzinger, Thomas A., et autres
Publié: (2025)

Positive Varieties of Lattice Languages
par: Inoue, Yusuke, et autres
Publié: (2025)

The Complexity of Aggregates over Extractions by Regular Expressions
par: Doleschal, Johannes, et autres
Publié: (2020)

On the Separability Problem of VASS Reachability Languages
par: Keskin, Eren, et autres
Publié: (2024)

Operational State Complexity of Block Languages
par: Duarte, Guilherme, et autres
Publié: (2024)

On the Representation and State Complexity of Block Languages
par: Duarte, Guilherme, et autres
Publié: (2024)

On the Complexity of Language Membership for Probabilistic Words
par: Amarilli, Antoine, et autres
Publié: (2025)

Stochastic Languages at Sub-stochastic Cost
par: Agarwal, Smayan, et autres
Publié: (2025)

Positive Characteristic Sets for Relational Pattern Languages
par: Mousawi, S. Mahmoud, et autres
Publié: (2025)

Idefix-Closed Languages and Their Application in Contextual Grammars
par: Ködding, Marvin, et autres
Publié: (2025)

A Tree Sampler for Bounded Context-Free Languages
par: Considine, Breandan
Publié: (2024)

Greybox Learning of Languages Recognizable by Event-Recording Automata
par: Majumdar, Anirban, et autres
Publié: (2024)

Kamp Theorem for Pomset Languages of Higher Dimensional Automata
par: Clement, Emily, et autres
Publié: (2024)

Some Remarks on First-Order Definable Tree Languages
par: Blumensath, Achim
Publié: (2024)

Languages of Boundedly-Ambiguous Vector Addition Systems with States
par: Czerwiński, Wojciech, et autres
Publié: (2025)

Atomic Gliders and CA as Language Generators (Extended Version)
par: Fisman, Dana, et autres
Publié: (2025)

Measure-Theoretic Aspects of Star-Free and Group Languages
par: Sin'ya, Ryoma, et autres
Publié: (2025)

Distribution of Reconfiguration Languages maintaining Tree-like Communication Topology
par: Hausmann, Daniel, et autres
Publié: (2024)

Algebraic Characterization of FO-definable Languages of Higher-Dimensional Automata
par: Erlich, Enzo, et autres
Publié: (2026)