Image de couverture de livre

On the piecewise complexity of words

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Schnoebelen, Philippe, Vialard, Isa
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

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

$2$-word-$π$-representable Graphs
par: Adamson, Duncan, et autres
Publié: (2026)

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

Population Protocols over Ordered Agents
par: Blondin, Michael, et autres
Publié: (2026)

Maximal 2-dimensional binary words of bounded degree
par: Massé, Alexandre Blondin, et autres
Publié: (2025)

On a sequence of Kimberling and its relationship to the Tribonacci word
par: Dvořáková, Lubomíra, et autres
Publié: (2025)

On state complexity for subword-closed languages
par: Guyot, Jérôme
Publié: (2024)

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

The complexity of finite smooth words over binary alphabets
par: Cassaigne, Julien, et autres
Publié: (2026)

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)

Computing the k-binomial complexity of generalized Thue--Morse words
par: Golafshan, M., et autres
Publié: (2024)

Low complexity binary words avoiding $(5/2)^+$-powers
par: Currie, James, et autres
Publié: (2025)

Automata on $S$-adic words
par: Berthé, Valérie, et autres
Publié: (2025)

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

Asymptotic bounds for the number of closed and privileged words
par: Gabric, Daniel
Publié: (2022)

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)

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)

Development of parallel programs on shared data-structures -- Revised version
par: Stølen, Ketil
Publié: (2024)

Active Learning of Deterministic Transducers with Outputs in Arbitrary Monoids
par: Aristote, Quentin
Publié: (2024)

Extended time Petri nets
par: Radom, Marcin, et autres
Publié: (2024)

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

Imposing Rules in Process Discovery: an Inductive Mining Approach
par: Norouzifar, Ali, et autres
Publié: (2024)

Non-deterministic asynchronous automata games and their undecidability
par: Adsul, Bharat, et autres
Publié: (2024)

Unveiling the connection between the Lyndon factorization and the Canonical Inverse Lyndon factorization via a border property
par: Bonizzoni, Paola, et autres
Publié: (2024)

Learning EFSM Models with Registers in Guards
par: Vega, Germán, et autres
Publié: (2024)

State estimation of timed automata under partial observation [Draft version]
par: Gao, Chao, et autres
Publié: (2024)