Image de couverture de livre

On state complexity for subword-closed languages

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Guyot, Jérôme
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

Arithmetical subword complexity of automatic sequences
par: Konieczny, Jakub, et autres
Publié: (2023)

Nondeterministic state complexity of square root
par: Onishchenko, Sergey
Publié: (2026)

Navigational hierarchies of regular languages
par: Place, Thomas, et autres
Publié: (2024)

Note on dissecting power of regular languages
par: Rukavicka, Josef
Publié: (2023)

On the piecewise complexity of words
par: Schnoebelen, Philippe, et autres
Publié: (2024)

Regular language quantum states
par: Florido-Llinàs, Marta, et autres
Publié: (2024)

Two-way affine automata can verify every language
par: Chen, Zeyu, et autres
Publié: (2025)

A pumping-like lemma for languages over infinite alphabets
par: Danieli, Yoav
Publié: (2025)

A short survey around the pumping lemma for context-free languages
par: Gullà, Gabriele
Publié: (2024)

Quantum finite automata and linear context-free languages: a decidable problem
par: Bertoni, A., et autres
Publié: (2013)

The complexity of separability for semilinear sets and Parikh automata
par: Collins, Elias Rojas, et autres
Publié: (2024)

The complexity of reachability problems in strongly connected finite automata
par: Kiefer, Stefan, et autres
Publié: (2025)

Exact descriptional complexity of determinization of input-driven pushdown automata
par: Martynova, Olga
Publié: (2024)

Characterization of deterministically recognizable weighted tree languages over commutative semifields by finitely generated and cancellative scalar algebras
par: Fülöp, Zoltán, et autres
Publié: (2025)

Infinite-state Games with Energy Objectives Beyond Counters
par: Sağlam, Irmak, et autres
Publié: (2026)

Soft state reduction of fuzzy automata over residuated lattices
par: Nguyen, Linh Anh, et autres
Publié: (2025)

Reachability in VASS Extended with Integer Counters
par: Bizière, Clotilde, et autres
Publié: (2026)

Watson-Crick conjugates of words and languages
par: Mahalingam, Kalpana, et autres
Publié: (2022)

[Draft] High-order estimation-based properties and high-order observers for labeled finite-state automata
par: Zhang, Kuize, et autres
Publié: (2024)

Is decidability of the Submonoid Membership Problem closed under finite extensions?
par: Shafrir, Doron
Publié: (2024)

Automata-based constraints for language model decoding
par: Koo, Terry, et autres
Publié: (2024)

Geodesic languages for rational subsets and conjugates in virtually free groups
par: Carvalho, André, et autres
Publié: (2024)

A cartesian closed fibration of higher-order regular languages
par: Melliès, Paul-André, et autres
Publié: (2026)

Sequential densities of rational languages
par: Gorman, Alexi Block, et autres
Publié: (2026)

Rauzy dimension and finite-state dimension
par: Becher, Verónica, et autres
Publié: (2024)

Finite Automata for Efficient Graph Recognition
par: Drewes, Frank, et autres
Publié: (2024)

MITL Model Checking via Generalized Timed Automata and a New Liveness Algorithm
par: Akshay, S., et autres
Publié: (2024)

A Formal Approach for Tuning Stochastic Oscillators
par: Ballarini, Paolo, et autres
Publié: (2024)

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

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

Lookahead Games and Efficient Determinisation of History-Deterministic Büchi Automata
par: Acharya, Rohan, et autres
Publié: (2024)

Characterization of Isometric Words based on Swap and Mismatch Distance
par: Anselmo, M., et autres
Publié: (2024)

$ω$-regular Expression Synthesis from Transition-Based Büchi Automata
par: Pert, Charles, et autres
Publié: (2024)

Deterministic Parikh automata on infinite words
par: Grobler, Mario, et autres
Publié: (2024)

Information-flow Interfaces and Security Lattices
par: Bartocci, Ezio, et autres
Publié: (2024)

Synthesis from LTL with Reward Optimization in Sampled Oblivious Environments
par: Raskin, Jean-François, et autres
Publié: (2024)

Two-Way One-Counter Nets Revisited
par: Almagor, Shaull, et autres
Publié: (2024)

5' -> 3' Watson-Crick Automata accepting Necklaces
par: Nagy, Benedek
Publié: (2024)

Reachability in One-Dimensional Pushdown Vector Addition Systems is Decidable
par: Bizière, Clotilde, et autres
Publié: (2024)

QuAK: Quantitative Automata Kit
par: Chalupa, Marek, et autres
Publié: (2024)