Saved in:
| Main Authors: | Klouda, Karel, Starosta, Štěpán |
|---|---|
| Format: | Preprint |
| Published: |
2021
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2108.11279 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Circularity and repetitiveness in non-injective DF0L systems
by: Goulet-Ouellet, Herman, et al.
Published: (2025)
by: Goulet-Ouellet, Herman, et al.
Published: (2025)
On Graph Grammars and Games
by: Vijayakumar, Jayakrishna, et al.
Published: (2024)
by: Vijayakumar, Jayakrishna, et al.
Published: (2024)
Anti-Context-Free languages
by: Cardó, Carles
Published: (2024)
by: Cardó, Carles
Published: (2024)
Isomorphisms of graphs of Hyperbinary Expansions and Efficient Algorithms for Stern's Diatomic Sequence
by: De Paris, Alessandro
Published: (2024)
by: De Paris, Alessandro
Published: (2024)
Disproving Termination of Non-Erasing Sole Combinatory Calculus with Tree Automata (Full Version)
by: Nakano, Keisuke, et al.
Published: (2024)
by: Nakano, Keisuke, et al.
Published: (2024)
From higher-order rewriting systems to higher-order categorial algebras and higher-order Curry-Howard isomorphisms
by: Vidal, Juan Climent, et al.
Published: (2024)
by: Vidal, Juan Climent, et al.
Published: (2024)
High-Performance Generation of Constrained Inputs
by: Crump, Addison, et al.
Published: (2025)
by: Crump, Addison, et al.
Published: (2025)
A Formalization of Abstract Rewriting in Agda
by: Arkle, Sam, et al.
Published: (2026)
by: Arkle, Sam, et al.
Published: (2026)
Around Context-Free Grammars -- a Normal Form, a Representation Theorem, and a Regular Approximation
by: Cojocaru, Liliana
Published: (2015)
by: Cojocaru, Liliana
Published: (2015)
A Lebesgue variant of the additive square problem
by: Vukusic, Ingrid
Published: (2025)
by: Vukusic, Ingrid
Published: (2025)
Language-Based Protocol Testing
by: Liggesmeyer, Alexander, et al.
Published: (2025)
by: Liggesmeyer, Alexander, et al.
Published: (2025)
Termination of Innermost-Terminating Right-Linear Overlay Term Rewrite Systems (Full Version)
by: Nishida, Naoki
Published: (2026)
by: Nishida, Naoki
Published: (2026)
Rewriting Induction for Existentially Quantified Equations in Logically Constrained Rewriting (Full Version)
by: Nishida, Naoki, et al.
Published: (2026)
by: Nishida, Naoki, et al.
Published: (2026)
Abstract Framework for All-Path Reachability Analysis toward Safety and Liveness Verification (Full Version)
by: Kojima, Misaki, et al.
Published: (2026)
by: Kojima, Misaki, et al.
Published: (2026)
On groups with EDT0L word problem
by: Bishop, Alex, et al.
Published: (2025)
by: Bishop, Alex, et al.
Published: (2025)
A central limit theorem in the framework of the Thompson group $F$
by: Krishnan, Arundhathi
Published: (2023)
by: Krishnan, Arundhathi
Published: (2023)
The asymptotic repetition threshold of sequences rich in palindromes
by: Dvořáková, Lubomíra, et al.
Published: (2024)
by: Dvořáková, Lubomíra, et al.
Published: (2024)
The Generation-Recognition Asymmetry: Six Dimensions of a Fundamental Divide in Formal Language Theory
by: Peyrichou, Romain
Published: (2026)
by: Peyrichou, Romain
Published: (2026)
Higher Catoids, Higher Quantales and their Correspondences
by: Calk, Cameron, et al.
Published: (2023)
by: Calk, Cameron, et al.
Published: (2023)
Higher-Order Pattern Unification Modulo Similarity Relations
by: Dundua, Besik, et al.
Published: (2025)
by: Dundua, Besik, et al.
Published: (2025)
On the study of cellular automata on modulo-recurrent words
by: Barro, Moussa, et al.
Published: (2022)
by: Barro, Moussa, et al.
Published: (2022)
Black-box Context-free Grammar Inference for Readable & Natural Grammars
by: Arefin, Mohammad Rifat, et al.
Published: (2025)
by: Arefin, Mohammad Rifat, et al.
Published: (2025)
Single-set cubical categories and their formalisation with a proof assistant (extended version)
by: Malbos, Philippe, et al.
Published: (2024)
by: Malbos, Philippe, et al.
Published: (2024)
On the ET0L subgroup membership problem in bounded automata groups
by: Bishop, Alex, et al.
Published: (2024)
by: Bishop, Alex, et al.
Published: (2024)
Dependence and Independence for Reversible Process Calculi
by: Aubert, Clément, et al.
Published: (2024)
by: Aubert, Clément, et al.
Published: (2024)
Decision Problems on Copying and Shuffling
by: Halava, Vesa, et al.
Published: (2023)
by: Halava, Vesa, et al.
Published: (2023)
Languages of Words of Low Automatic Complexity Are Hard to Compute
by: Chen, Joey, et al.
Published: (2025)
by: Chen, Joey, et al.
Published: (2025)
Graphs and groups with unique geodesics
by: Elder, Murray, et al.
Published: (2023)
by: Elder, Murray, et al.
Published: (2023)
A quantum implementation of high-order power method for estimating geometric entanglement of pure states
by: Semenov, Andrii, et al.
Published: (2024)
by: Semenov, Andrii, et al.
Published: (2024)
Lindenmayer graph languages, first-order theories and expanders
by: Knapik, Teodor
Published: (2024)
by: Knapik, Teodor
Published: (2024)
Improvement Ergodic Theory For The Infinite Word $\mathfrak{F}=\mathfrak{F}_{b}:=\left({ }_{b} f_{n}\right)_{n \geqslant 0}$ on Fibonacci Density
by: Hamoud, Jasem, et al.
Published: (2025)
by: Hamoud, Jasem, et al.
Published: (2025)
Remote Verification System for Mizar Integrated with Emwiki
by: Kai, Toshiki, et al.
Published: (2024)
by: Kai, Toshiki, et al.
Published: (2024)
Computational Complexity of Determining the Assembly Index
by: Masierak, Piotr
Published: (2026)
by: Masierak, Piotr
Published: (2026)
Well-Quasi-Orderings on Word Languages
by: Lhote, Nathan, et al.
Published: (2025)
by: Lhote, Nathan, et al.
Published: (2025)
Metalevel transformation of strategies
by: Rubio, Rubén, et al.
Published: (2024)
by: Rubio, Rubén, et al.
Published: (2024)
Walking on Words
by: Pratt-Hartmann, Ian
Published: (2022)
by: Pratt-Hartmann, Ian
Published: (2022)
On Quantum Context-Free Grammars
by: Aruja, Merina, et al.
Published: (2025)
by: Aruja, Merina, et al.
Published: (2025)
On the Asymptotic Palindrome Density of Fibonacci Infinite Words
by: Abdullah, Duaa, et al.
Published: (2025)
by: Abdullah, Duaa, et al.
Published: (2025)
Dynamic and Programmatic Analysis of Fibonacci Word Density
by: Abdullah, Duaa, et al.
Published: (2025)
by: Abdullah, Duaa, et al.
Published: (2025)
Generalized Natural Density $\DF(\mathfrak{F}_n)$ of Fibonacci Word
by: Hamoud, Jasem, et al.
Published: (2025)
by: Hamoud, Jasem, et al.
Published: (2025)
Similar Items
-
Circularity and repetitiveness in non-injective DF0L systems
by: Goulet-Ouellet, Herman, et al.
Published: (2025) -
On Graph Grammars and Games
by: Vijayakumar, Jayakrishna, et al.
Published: (2024) -
Anti-Context-Free languages
by: Cardó, Carles
Published: (2024) -
Isomorphisms of graphs of Hyperbinary Expansions and Efficient Algorithms for Stern's Diatomic Sequence
by: De Paris, Alessandro
Published: (2024) -
Disproving Termination of Non-Erasing Sole Combinatory Calculus with Tree Automata (Full Version)
by: Nakano, Keisuke, et al.
Published: (2024)