Saved in:
| Main Author: | Volkov, Mikhail V. |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2412.16113 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
The complexity of intersecting subproducts with subgroups in Cartesian powers
by: Spelier, Pim
Published: (2021)
by: Spelier, Pim
Published: (2021)
The hereditariness problem for the Černý conjecture
by: Rodaro, Emanuele, et al.
Published: (2025)
by: Rodaro, Emanuele, et al.
Published: (2025)
The Freeness Problem for Automaton Semigroups
by: D'Angeli, Daniele, et al.
Published: (2024)
by: D'Angeli, Daniele, et al.
Published: (2024)
The Word Problem for $(ω- 1)$-Terms over $\mathrm{DAb}$
by: Almeida, Jorge, et al.
Published: (2024)
by: Almeida, Jorge, et al.
Published: (2024)
The Word Problem for Finitary Automaton Groups
by: Kotowsky, Maximilian, et al.
Published: (2023)
by: Kotowsky, Maximilian, et al.
Published: (2023)
A new Boolean matrix representation for Catalan semirings
by: Volkov, Mikhail
Published: (2025)
by: Volkov, Mikhail
Published: (2025)
Groups with presentations in EDT0L
by: Bartholdi, Laurent, et al.
Published: (2024)
by: Bartholdi, Laurent, et al.
Published: (2024)
Regularity of quasigeodesics characterises hyperbolicity
by: Hughes, Sam, et al.
Published: (2022)
by: Hughes, Sam, et al.
Published: (2022)
Simplicity and irreducibility in circular automata
by: Venturi, Riccardo
Published: (2025)
by: Venturi, Riccardo
Published: (2025)
Preserving self-similarity in free products of semigroups
by: Brough, Tara Macalister, et al.
Published: (2020)
by: Brough, Tara Macalister, et al.
Published: (2020)
Uniform winning strategies for the synchronization games on subclasses of finite automata
by: Fernau, Henning, et al.
Published: (2025)
by: Fernau, Henning, et al.
Published: (2025)
Bandwidth of Nondeterministic Finite Automata
by: Cho, Da-Jung, et al.
Published: (2026)
by: Cho, Da-Jung, et al.
Published: (2026)
Context-Free Trees
by: Wächter, Jan Philipp
Published: (2026)
by: Wächter, Jan Philipp
Published: (2026)
Teaching and Learning under Deductive Errors
by: Telle, Jan Arne, et al.
Published: (2026)
by: Telle, Jan Arne, et al.
Published: (2026)
Enabling Lie-Algebraic Classical Simulation beyond Free Fermions
by: Bärligea, Adelina, et al.
Published: (2026)
by: Bärligea, Adelina, et al.
Published: (2026)
A central limit theorem in the framework of the Thompson group $F$
by: Krishnan, Arundhathi
Published: (2023)
by: Krishnan, Arundhathi
Published: (2023)
Computational Complexity of Finding Subgroups of a Given Order
by: Lakshmanan, K.
Published: (2025)
by: Lakshmanan, K.
Published: (2025)
Parameterized Complexity of Factorization Problems
by: Lohrey, Markus, et al.
Published: (2023)
by: Lohrey, Markus, et al.
Published: (2023)
Quadratic Equations in Graph Products of Groups and the Exponent of Periodicity
by: Diekert, Volker, et al.
Published: (2026)
by: Diekert, Volker, et al.
Published: (2026)
On A. V. Anisimov's problem for finding a polynomial algorithm checking inclusion of context-free languages in group languages
by: Yordzhev, Krasimir
Published: (2026)
by: Yordzhev, Krasimir
Published: (2026)
On the ET0L subgroup membership problem in bounded automata groups
by: Bishop, Alex, et al.
Published: (2024)
by: Bishop, Alex, et al.
Published: (2024)
Chemical Systems as Ternary $Γ$-Semirings:Theory, Case Studies, and Operational Tests
by: Gokavarapu, Chandrasekhar, et al.
Published: (2025)
by: Gokavarapu, Chandrasekhar, et al.
Published: (2025)
Conjugacy languages in virtual graph products
by: Crowe, Gemma
Published: (2022)
by: Crowe, Gemma
Published: (2022)
Computing Embeddings and Isomorphisms of Finite Semigroups
by: East, James, et al.
Published: (2016)
by: East, James, et al.
Published: (2016)
Correspondence between factorability and normalisation in monoids
by: Đurić, Alen
Published: (2022)
by: Đurić, Alen
Published: (2022)
Computational complexity of counting coincidences
by: Chan, Swee Hong, et al.
Published: (2023)
by: Chan, Swee Hong, et al.
Published: (2023)
Certified Finite-State Induction for a Perturbed Hofstadter Recursion
by: Mantovanelli, Marco
Published: (2026)
by: Mantovanelli, Marco
Published: (2026)
Languages given by Finite Automata over the Unary Alphabet
by: Czerwiński, Wojciech, et al.
Published: (2023)
by: Czerwiński, Wojciech, et al.
Published: (2023)
Reduction of the group isomorphism problem to the group automorphism problem
by: Skresanov, Saveliy V.
Published: (2025)
by: Skresanov, Saveliy V.
Published: (2025)
Permutation closure for multiple context-free languages
by: Duncan, Andrew, et al.
Published: (2025)
by: Duncan, Andrew, et al.
Published: (2025)
A substitution lemma for multiple context-free languages
by: Duncan, Andrew, et al.
Published: (2025)
by: Duncan, Andrew, et al.
Published: (2025)
Linear extensions of finite posets
by: Chan, Swee Hong, et al.
Published: (2023)
by: Chan, Swee Hong, et al.
Published: (2023)
Weyl Groups and the Modified Kostant Game
by: Castro, Alexander Caviedes, et al.
Published: (2026)
by: Castro, Alexander Caviedes, et al.
Published: (2026)
Don's conjecture for binary completely reachable automata: an approach and its limitations
by: Casas, David, et al.
Published: (2023)
by: Casas, David, et al.
Published: (2023)
Formal Foundations for Controlled Stochastic Activity Networks
by: Movaghar, Ali
Published: (2025)
by: Movaghar, Ali
Published: (2025)
The average-case complexity of the Word Problem for groups of matrices over $\mathbb{Z}$ is linear
by: Bassino, Frédérique, et al.
Published: (2025)
by: Bassino, Frédérique, et al.
Published: (2025)
Homomorphically Full Oriented Graphs
by: Bellitto, Thomas, et al.
Published: (2022)
by: Bellitto, Thomas, et al.
Published: (2022)
All Equalities Are Equal, but Some Are More Equal Than Others: The Effect of Implementation Aliasing on the Numerical Solution to Conservation Equations
by: Trojak, Will, et al.
Published: (2019)
by: Trojak, Will, et al.
Published: (2019)
Implementing Basic Arithmetic in $\mathbb{F}_p$ via $\mathbb{F}_2$, and Its Application for Computing the Hamming Distance of Linear Codes
by: Hernando, Fernando, et al.
Published: (2026)
by: Hernando, Fernando, et al.
Published: (2026)
Fast Algorithms for the Computation of the Minimum Distance of a Random Linear Code
by: Hernando, Fernando, et al.
Published: (2016)
by: Hernando, Fernando, et al.
Published: (2016)
Similar Items
-
The complexity of intersecting subproducts with subgroups in Cartesian powers
by: Spelier, Pim
Published: (2021) -
The hereditariness problem for the Černý conjecture
by: Rodaro, Emanuele, et al.
Published: (2025) -
The Freeness Problem for Automaton Semigroups
by: D'Angeli, Daniele, et al.
Published: (2024) -
The Word Problem for $(ω- 1)$-Terms over $\mathrm{DAb}$
by: Almeida, Jorge, et al.
Published: (2024) -
The Word Problem for Finitary Automaton Groups
by: Kotowsky, Maximilian, et al.
Published: (2023)