Saved in:
| Main Authors: | Schnoebelen, Philippe, Vialard, Isa |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2412.16560 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Deterministic Parikh automata on infinite words
by: Grobler, Mario, et al.
Published: (2024)
by: Grobler, Mario, et al.
Published: (2024)
Population Protocols over Ordered Agents
by: Blondin, Michael, et al.
Published: (2026)
by: Blondin, Michael, et al.
Published: (2026)
$2$-word-$π$-representable Graphs
by: Adamson, Duncan, et al.
Published: (2026)
by: Adamson, Duncan, et al.
Published: (2026)
Watson-Crick conjugates of words and languages
by: Mahalingam, Kalpana, et al.
Published: (2022)
by: Mahalingam, Kalpana, et al.
Published: (2022)
The complexity of finite smooth words over binary alphabets
by: Cassaigne, Julien, et al.
Published: (2026)
by: Cassaigne, Julien, et al.
Published: (2026)
Maximal 2-dimensional binary words of bounded degree
by: Massé, Alexandre Blondin, et al.
Published: (2025)
by: Massé, Alexandre Blondin, et al.
Published: (2025)
On a sequence of Kimberling and its relationship to the Tribonacci word
by: Dvořáková, Lubomíra, et al.
Published: (2025)
by: Dvořáková, Lubomíra, et al.
Published: (2025)
On state complexity for subword-closed languages
by: Guyot, Jérôme
Published: (2024)
by: Guyot, Jérôme
Published: (2024)
Nondeterministic state complexity of square root
by: Onishchenko, Sergey
Published: (2026)
by: Onishchenko, Sergey
Published: (2026)
The complexity of separability for semilinear sets and Parikh automata
by: Collins, Elias Rojas, et al.
Published: (2024)
by: Collins, Elias Rojas, et al.
Published: (2024)
The complexity of reachability problems in strongly connected finite automata
by: Kiefer, Stefan, et al.
Published: (2025)
by: Kiefer, Stefan, et al.
Published: (2025)
Exact descriptional complexity of determinization of input-driven pushdown automata
by: Martynova, Olga
Published: (2024)
by: Martynova, Olga
Published: (2024)
Computing the k-binomial complexity of generalized Thue--Morse words
by: Golafshan, M., et al.
Published: (2024)
by: Golafshan, M., et al.
Published: (2024)
Low complexity binary words avoiding $(5/2)^+$-powers
by: Currie, James, et al.
Published: (2025)
by: Currie, James, et al.
Published: (2025)
Automata on $S$-adic words
by: Berthé, Valérie, et al.
Published: (2025)
by: Berthé, Valérie, et al.
Published: (2025)
Generating a Gray code for prefix normal words in amortized polylogarithmic time per word
by: Burcsi, Péter, et al.
Published: (2020)
by: Burcsi, Péter, et al.
Published: (2020)
Asymptotic bounds for the number of closed and privileged words
by: Gabric, Daniel
Published: (2022)
by: Gabric, Daniel
Published: (2022)
The termination of Nielsen transformations applied to word equations with length constraints
by: Przybocki, Benjamin, et al.
Published: (2025)
by: Przybocki, Benjamin, et al.
Published: (2025)
Mapping words to powers by morphisms
by: Saarela, Aleksi
Published: (2025)
by: Saarela, Aleksi
Published: (2025)
On the complexity of computing Strahler numbers
by: Ganardi, Moses, et al.
Published: (2025)
by: Ganardi, Moses, et al.
Published: (2025)
Balanced Fibonacci word rectangles, and beyond
by: Shallit, Jeffrey, et al.
Published: (2025)
by: Shallit, Jeffrey, et al.
Published: (2025)
Entropy of pebble automata and space complexity
by: Montoya, J. Andres
Published: (2026)
by: Montoya, J. Andres
Published: (2026)
Arithmetical subword complexity of automatic sequences
by: Konieczny, Jakub, et al.
Published: (2023)
by: Konieczny, Jakub, et al.
Published: (2023)
Finite Automata for Efficient Graph Recognition
by: Drewes, Frank, et al.
Published: (2024)
by: Drewes, Frank, et al.
Published: (2024)
MITL Model Checking via Generalized Timed Automata and a New Liveness Algorithm
by: Akshay, S., et al.
Published: (2024)
by: Akshay, S., et al.
Published: (2024)
A Formal Approach for Tuning Stochastic Oscillators
by: Ballarini, Paolo, et al.
Published: (2024)
by: Ballarini, Paolo, et al.
Published: (2024)
A Tree Sampler for Bounded Context-Free Languages
by: Considine, Breandan
Published: (2024)
by: Considine, Breandan
Published: (2024)
Distribution of Reconfiguration Languages maintaining Tree-like Communication Topology
by: Hausmann, Daniel, et al.
Published: (2024)
by: Hausmann, Daniel, et al.
Published: (2024)
Lookahead Games and Efficient Determinisation of History-Deterministic Büchi Automata
by: Acharya, Rohan, et al.
Published: (2024)
by: Acharya, Rohan, et al.
Published: (2024)
Characterization of Isometric Words based on Swap and Mismatch Distance
by: Anselmo, M., et al.
Published: (2024)
by: Anselmo, M., et al.
Published: (2024)
$ω$-regular Expression Synthesis from Transition-Based Büchi Automata
by: Pert, Charles, et al.
Published: (2024)
by: Pert, Charles, et al.
Published: (2024)
Information-flow Interfaces and Security Lattices
by: Bartocci, Ezio, et al.
Published: (2024)
by: Bartocci, Ezio, et al.
Published: (2024)
Synthesis from LTL with Reward Optimization in Sampled Oblivious Environments
by: Raskin, Jean-François, et al.
Published: (2024)
by: Raskin, Jean-François, et al.
Published: (2024)
Two-Way One-Counter Nets Revisited
by: Almagor, Shaull, et al.
Published: (2024)
by: Almagor, Shaull, et al.
Published: (2024)
5' -> 3' Watson-Crick Automata accepting Necklaces
by: Nagy, Benedek
Published: (2024)
by: Nagy, Benedek
Published: (2024)
Reachability in One-Dimensional Pushdown Vector Addition Systems is Decidable
by: Bizière, Clotilde, et al.
Published: (2024)
by: Bizière, Clotilde, et al.
Published: (2024)
QuAK: Quantitative Automata Kit
by: Chalupa, Marek, et al.
Published: (2024)
by: Chalupa, Marek, et al.
Published: (2024)
Development of parallel programs on shared data-structures -- Revised version
by: Stølen, Ketil
Published: (2024)
by: Stølen, Ketil
Published: (2024)
Active Learning of Deterministic Transducers with Outputs in Arbitrary Monoids
by: Aristote, Quentin
Published: (2024)
by: Aristote, Quentin
Published: (2024)
Extended time Petri nets
by: Radom, Marcin, et al.
Published: (2024)
by: Radom, Marcin, et al.
Published: (2024)
Similar Items
-
Deterministic Parikh automata on infinite words
by: Grobler, Mario, et al.
Published: (2024) -
Population Protocols over Ordered Agents
by: Blondin, Michael, et al.
Published: (2026) -
$2$-word-$π$-representable Graphs
by: Adamson, Duncan, et al.
Published: (2026) -
Watson-Crick conjugates of words and languages
by: Mahalingam, Kalpana, et al.
Published: (2022) -
The complexity of finite smooth words over binary alphabets
by: Cassaigne, Julien, et al.
Published: (2026)