Image de couverture de livre

Rabin Games and Colourful Universal Trees

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Majumdar, Rupak, Saglam, Irmak, Thejaswini, K. S.
Format:	Preprint
Publié:	2024
Sujets:	Logic in Computer Science Data Structures and Algorithms Formal Languages and Automata Theory F.4.1; G.2.1
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Scalable Learning of One-Counter Automata via State-Merging Algorithms
par: Guha, Shibashis, et autres
Publié: (2025)

Model-Checking PCTL Properties of Stateless Probabilistic Pushdown Systems
par: Lin, Deren, et autres
Publié: (2014)

Inquisitive Team Semantics of LTL
par: Bozzelli, Laura, et autres
Publié: (2025)

A Theory of Hanoi Omega-Automata and Games
par: Filiot, Emmanuel, et autres
Publié: (2026)

Have a thing? Reasoning around recursion with dynamic typing in grounded arithmetic
par: Bobrow, Elliot, et autres
Publié: (2025)

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)

Satisfiability of Context-free String Constraints with Subword-ordering and Transducers
par: Aiswarya, C, et autres
Publié: (2024)

(Sets of ) Complement Scattered Factors
par: Adamson, Duncan, et autres
Publié: (2026)

Equivariant ideals of polynomials
par: Ghosh, Arka, et autres
Publié: (2024)

Characterizing NC1 with Typed Monoids
par: Dawar, Anuj, et autres
Publié: (2025)

A Myhill-Nerode Type Characterization of 2detLIN Languages
par: Nagy, Benedek
Publié: (2025)

A Myhill-Nerode Theorem for Generalized Automata, with Applications to Pattern Matching and Compression
par: Cotumaccio, Nicola
Publié: (2023)

Constant-delay enumeration for SLP-compressed documents
par: Muñoz, Martín, et autres
Publié: (2022)

Data Structures for Finite Downsets of Natural Vectors: Theory and Practice
par: Cadilhac, Michaël, et autres
Publié: (2025)

From Compactifying Lambda-Letrec Terms to Recognizing Regular-Expression Processes
par: Grabmayer, Clemens
Publié: (2024)

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

$k$-Universality of Regular Languages Revisited
par: Adamson, Duncan, et autres
Publié: (2025)

Openness And Partial Adjacency In One Variable TPTL
par: Krishna, Shankara Narayanan, et autres
Publié: (2024)

Dynamic direct (ranked) access of MSO query evaluation over SLP-compressed strings
par: Muñoz, Martín
Publié: (2026)

Dynamic Membership for Regular Tree Languages
par: Amarilli, Antoine, et autres
Publié: (2025)

Prefix Trees Improve Memory Consumption in Large-Scale Continuous-Time Stochastic Models
par: Taylor, Landon, et autres
Publié: (2025)

Polynomial Bounds of CFLOBDDs against BDDs
par: Zhi, Xusheng, et autres
Publié: (2024)

Stratifiable formulae are not context-free
par: Ryan-Smith, Calliope
Publié: (2023)

On a Generalization of the Christoffel Tree: Epichristoffel Trees
par: Krishnamoorthy, Abhishek, et autres
Publié: (2025)

Hypernode Automata
par: Bartocci, Ezio, et autres
Publié: (2023)

One-sided Hom shifts
par: Béal, Marie-Pierre, et autres
Publié: (2025)

A closer look at TDFA
par: Borsotti, Angelo, et autres
Publié: (2022)

Maximal Closed Substrings
par: Badkobeh, Golnaz, et autres
Publié: (2022)

Novel Results on the Number of Runs of the Burrows-Wheeler-Transform
par: Giuliani, Sara, et autres
Publié: (2020)

A Fast Algorithm for Computing Prefix Probabilities
par: Nowak, Franz, et autres
Publié: (2023)

Generating a Gray code for prefix normal words in amortized polylogarithmic time per word
par: Burcsi, Péter, et autres
Publié: (2020)

Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space
par: Inenaga, Shunsuke, et autres
Publié: (2024)

Absent Subsequences in Words
par: Kosche, Maria, et autres
Publié: (2021)

Exponent-Strings and Their Edit Distance
par: Baek, Ingyu
Publié: (2024)

Subsequences in Bounded Ranges: Matching and Analysis Problems
par: Kosche, Maria, et autres
Publié: (2022)

Indexing Finite-State Automata Using Forward-Stable Partitions
par: Becker, Ruben, et autres
Publié: (2024)

Efficient Matching of Some Fundamental Regular Expressions with Backreferences
par: Nogami, Taisei, et autres
Publié: (2025)

Deciding Reachability and the Covering Problem with Diagnostics for Sound Acyclic Free-Choice Workflow Nets
par: Prinz, Thomas M., et autres
Publié: (2026)

Algorithmical Aspects of Some Bio Inspired Operations
par: Dumitran, Marius
Publié: (2025)