:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Klouda, Karel, Starosta, Štěpán
Format:	Preprint
Publié:	2021
Sujets:	Combinatorics 68R15, 68Q42, 68V20 F.4.2
Accès en ligne:	https://arxiv.org/abs/2108.11279
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Circularity and repetitiveness in non-injective DF0L systems
par: Goulet-Ouellet, Herman, et autres
Publié: (2025)

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

Anti-Context-Free languages
par: Cardó, Carles
Publié: (2024)

Isomorphisms of graphs of Hyperbinary Expansions and Efficient Algorithms for Stern's Diatomic Sequence
par: De Paris, Alessandro
Publié: (2024)

Disproving Termination of Non-Erasing Sole Combinatory Calculus with Tree Automata (Full Version)
par: Nakano, Keisuke, et autres
Publié: (2024)

From higher-order rewriting systems to higher-order categorial algebras and higher-order Curry-Howard isomorphisms
par: Vidal, Juan Climent, et autres
Publié: (2024)

High-Performance Generation of Constrained Inputs
par: Crump, Addison, et autres
Publié: (2025)

A Formalization of Abstract Rewriting in Agda
par: Arkle, Sam, et autres
Publié: (2026)

Around Context-Free Grammars -- a Normal Form, a Representation Theorem, and a Regular Approximation
par: Cojocaru, Liliana
Publié: (2015)

A Lebesgue variant of the additive square problem
par: Vukusic, Ingrid
Publié: (2025)

Language-Based Protocol Testing
par: Liggesmeyer, Alexander, et autres
Publié: (2025)

Termination of Innermost-Terminating Right-Linear Overlay Term Rewrite Systems (Full Version)
par: Nishida, Naoki
Publié: (2026)

Rewriting Induction for Existentially Quantified Equations in Logically Constrained Rewriting (Full Version)
par: Nishida, Naoki, et autres
Publié: (2026)

Abstract Framework for All-Path Reachability Analysis toward Safety and Liveness Verification (Full Version)
par: Kojima, Misaki, et autres
Publié: (2026)

On groups with EDT0L word problem
par: Bishop, Alex, et autres
Publié: (2025)

A central limit theorem in the framework of the Thompson group $F$
par: Krishnan, Arundhathi
Publié: (2023)

The asymptotic repetition threshold of sequences rich in palindromes
par: Dvořáková, Lubomíra, et autres
Publié: (2024)

The Generation-Recognition Asymmetry: Six Dimensions of a Fundamental Divide in Formal Language Theory
par: Peyrichou, Romain
Publié: (2026)

Higher Catoids, Higher Quantales and their Correspondences
par: Calk, Cameron, et autres
Publié: (2023)

Higher-Order Pattern Unification Modulo Similarity Relations
par: Dundua, Besik, et autres
Publié: (2025)

On the study of cellular automata on modulo-recurrent words
par: Barro, Moussa, et autres
Publié: (2022)

Black-box Context-free Grammar Inference for Readable & Natural Grammars
par: Arefin, Mohammad Rifat, et autres
Publié: (2025)

Single-set cubical categories and their formalisation with a proof assistant (extended version)
par: Malbos, Philippe, et autres
Publié: (2024)

On the ET0L subgroup membership problem in bounded automata groups
par: Bishop, Alex, et autres
Publié: (2024)

Dependence and Independence for Reversible Process Calculi
par: Aubert, Clément, et autres
Publié: (2024)

Decision Problems on Copying and Shuffling
par: Halava, Vesa, et autres
Publié: (2023)

Languages of Words of Low Automatic Complexity Are Hard to Compute
par: Chen, Joey, et autres
Publié: (2025)

Graphs and groups with unique geodesics
par: Elder, Murray, et autres
Publié: (2023)

A quantum implementation of high-order power method for estimating geometric entanglement of pure states
par: Semenov, Andrii, et autres
Publié: (2024)

Lindenmayer graph languages, first-order theories and expanders
par: Knapik, Teodor
Publié: (2024)

Improvement Ergodic Theory For The Infinite Word $\mathfrak{F}=\mathfrak{F}_{b}:=\left({ }_{b} f_{n}\right)_{n \geqslant 0}$ on Fibonacci Density
par: Hamoud, Jasem, et autres
Publié: (2025)

Remote Verification System for Mizar Integrated with Emwiki
par: Kai, Toshiki, et autres
Publié: (2024)

Computational Complexity of Determining the Assembly Index
par: Masierak, Piotr
Publié: (2026)

Well-Quasi-Orderings on Word Languages
par: Lhote, Nathan, et autres
Publié: (2025)

Metalevel transformation of strategies
par: Rubio, Rubén, et autres
Publié: (2024)

Walking on Words
par: Pratt-Hartmann, Ian
Publié: (2022)

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

On the Asymptotic Palindrome Density of Fibonacci Infinite Words
par: Abdullah, Duaa, et autres
Publié: (2025)

Dynamic and Programmatic Analysis of Fibonacci Word Density
par: Abdullah, Duaa, et autres
Publié: (2025)

Generalized Natural Density $\DF(\mathfrak{F}_n)$ of Fibonacci Word
par: Hamoud, Jasem, et autres
Publié: (2025)