Image de couverture de livre

From Historical Puzzles to Grammatical Constraints: Circular Partitions, Generalized Run-Length Encodings, and Polynomial-Time Decidability

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Khormali, Omid, Mtimet, Ghaya, Aydin, Nuh
Format:	Preprint
Publié:	2026
Sujets:	Formal Languages and Automata Theory Discrete Mathematics Combinatorics 68Q45, 68R15, 68W40
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Dissecting power of intersection of two context-free languages
par: Rukavicka, Josef
Publié: (2020)

Effective Computation of Generalized Abelian Complexity for Pisot Type Substitutive Sequences
par: Couvreur, Jean-Michel, et autres
Publié: (2025)

Improved Randomized Approximation of Hard Universality and Emptiness Problems
par: Andreou, Pantelis, et autres
Publié: (2024)

Bandwidth of Nondeterministic Finite Automata
par: Cho, Da-Jung, et autres
Publié: (2026)

Semidirect Product Decompositions for Periodic Regular Languages
par: Inoue, Yusuke, et autres
Publié: (2024)

A cornering strategy for synchronizing a DFA
par: Bradshaw, Peter, et autres
Publié: (2024)

Positionality of Dumont--Thomas numeration systems for integers
par: Kreczman, Savinien, et autres
Publié: (2025)

A Note on the Relation between Recognisable Series and Regular Sequences, and their Minimal Linear Representations
par: Heuberger, Clemens, et autres
Publié: (2022)

On A. V. Anisimov's problem for finding a polynomial algorithm checking inclusion of context-free languages in group languages
par: Yordzhev, Krasimir
Publié: (2026)

On Quantum Context-Free Grammars
par: Aruja, Merina, et autres
Publié: (2025)

A hierarchy of reversible finite automata
par: Radionova, Maria, et autres
Publié: (2024)

On Computational Completeness of Semi-Conditional Matrix Grammars
par: Fernau, Henning, et autres
Publié: (2024)

Nondeterministic tree-walking automata are not closed under complementation
par: Martynova, Olga, et autres
Publié: (2024)

A lower bound on the state complexity of transforming two-way nondeterministic finite automata to unambiguous finite automata
par: Petrov, Semyon, et autres
Publié: (2024)

Mostowski Index via extended register games
par: Idir, Olivier, et autres
Publié: (2024)

An $L^{\#}$ Based Algorithm for Active Learning of Minimal Separating Automata
par: Laumen, Jasper, et autres
Publié: (2026)

From regular expressions to deterministic finite automata: $2^{\frac{n}{2}+\sqrt{n}(\log n)^{Θ(1)}}$ states are necessary and sufficient
par: Martynova, Olga, et autres
Publié: (2025)

Bounded Languages Described by GF(2)-grammars
par: Makarov, Vladislav
Publié: (2019)

Linear equations and recursively enumerable sets
par: Honkala, Juha
Publié: (2024)

A quadratic upper bound on the reset thresholds of synchronizing automata containing a transitive permutation group
par: Zhu, Yinfeng
Publié: (2024)

Around Don's conjecture for binary completely reachable automata
par: Zhu, Yinfeng
Publié: (2024)

Don's conjecture for binary completely reachable automata: an approach and its limitations
par: Casas, David, et autres
Publié: (2023)

Decidability of membership problems for flat rational subsets of $\mathrm{GL}(2,\mathbb{Q})$ and singular matrices
par: Diekert, Volker, et autres
Publié: (2019)

Introducing q-deformed binomial coefficients of words
par: Renard, Antoine, et autres
Publié: (2024)

Deciding Sparseness of Regular Languages of Finite Trees and Infinite Words
par: Eickmeyer, Kord, et autres
Publié: (2025)

Illustrating Finite Automata with Grail+ and TikZ
par: May, Alastair, et autres
Publié: (2024)

The generating power of weighted tree automata with initial algebra semantics
par: Droste, Manfred, et autres
Publié: (2024)

Restivo Salemi property for $α$-power free languages with $α\geq 5$ and $k\geq 3$ letters
par: Rukavicka, Josef
Publié: (2023)

A generalization of Deterministic Finite Automata related to discharging
par: Campbell, John M.
Publié: (2025)

Runs, Squares, Palindromes, and Unbordered Factors of a Family of Binary Pattern Sequences with the All-One Pattern
par: Hendel, Russell Jay
Publié: (2025)

Languages given by Finite Automata over the Unary Alphabet
par: Czerwiński, Wojciech, et autres
Publié: (2023)

Context-Free Trees
par: Wächter, Jan Philipp
Publié: (2026)

On Graph Grammars and Games
par: Vijayakumar, Jayakrishna, et autres
Publié: (2024)

The repetition threshold for ternary rich words
par: Currie, James D., et autres
Publié: (2024)

Avoiding abelian and additive powers in rich words
par: Andrade, Jonathan, et autres
Publié: (2024)

Digital Convexity and Combinatorics on Words
par: De Luca, Alessandro, et autres
Publié: (2025)

A polynomial-time algorithm for the automatic Baire property
par: Staiger, Ludwig
Publié: (2025)

On Languages Describing Large Graph Classes
par: Fernau, Henning, et autres
Publié: (2026)

A note on Automatic Baire property
par: Staiger, Ludwig
Publié: (2025)

Weakly-unambiguous Parikh automata and their link to holonomic series
par: Bostan, Alin, et autres
Publié: (2025)