Effective equation solving, constraints and growth in virtually abelian groups
Fuente:
arXiv
Saved in:
| Main Authors: | Ciobanu, Laura, Evetts, Alex, Levine, Alex |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Subsets of groups with context-free preimages
by: Levine, Alex
Published: (2023)
by: Levine, Alex
Published: (2023)
On groups with EDT0L word problem
by: Bishop, Alex, et al.
Published: (2025)
by: Bishop, Alex, et al.
Published: (2025)
Permutation closure for multiple context-free languages
by: Duncan, Andrew, et al.
Published: (2025)
by: Duncan, Andrew, et al.
Published: (2025)
The word problem and growth of groups
by: Bondarenko, Ievgen
Published: (2024)
by: Bondarenko, Ievgen
Published: (2024)
The Freeness Problem for Automaton Semigroups
by: D'Angeli, Daniele, et al.
Published: (2024)
by: D'Angeli, Daniele, 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)
Context-free graphs and their transition groups
by: D'Angeli, Daniele, et al.
Published: (2024)
by: D'Angeli, Daniele, et al.
Published: (2024)
Twisted conjugacy growth series of virtually abelian groups
by: Evetts, Alex, et al.
Published: (2024)
by: Evetts, Alex, et al.
Published: (2024)
Solutions of Word Equations over Partially Commutative Structures
by: Diekert, Volker, et al.
Published: (2016)
by: Diekert, Volker, et al.
Published: (2016)
Free inverse monoids are co-context-free
by: Brough, Tara Macalister, et al.
Published: (2025)
by: Brough, Tara Macalister, et al.
Published: (2025)
The Word Problem for Finitary Automaton Groups
by: Kotowsky, Maximilian, et al.
Published: (2023)
by: Kotowsky, Maximilian, et al.
Published: (2023)
The Word Problem for $(ω- 1)$-Terms over $\mathrm{DAb}$
by: Almeida, Jorge, et al.
Published: (2024)
by: Almeida, Jorge, et al.
Published: (2024)
Preserving self-similarity in free products of semigroups
by: Brough, Tara Macalister, et al.
Published: (2020)
by: Brough, Tara Macalister, et al.
Published: (2020)
A substitution lemma for multiple context-free languages
by: Duncan, Andrew, et al.
Published: (2025)
by: Duncan, Andrew, et al.
Published: (2025)
Conjugacy languages in virtual graph products
by: Crowe, Gemma
Published: (2022)
by: Crowe, Gemma
Published: (2022)
Counting automorphic orbits in finitely generated groups
by: Elliott, Luna, et al.
Published: (2026)
by: Elliott, Luna, et al.
Published: (2026)
Word equations and the exponent of periodicity
by: Diekert, Volker, et al.
Published: (2025)
by: Diekert, Volker, et al.
Published: (2025)
Generalizations of the Muller-Schupp theorem and tree-like inverse graphs
by: Rodaro, Emanuele
Published: (2023)
by: Rodaro, Emanuele
Published: (2023)
Presheaf automata
by: Struth, Georg, et al.
Published: (2024)
by: Struth, Georg, et al.
Published: (2024)
A polynomial-time algorithm for the automatic Baire property
by: Staiger, Ludwig
Published: (2025)
by: Staiger, Ludwig
Published: (2025)
On Languages Describing Large Graph Classes
by: Fernau, Henning, et al.
Published: (2026)
by: Fernau, Henning, et al.
Published: (2026)
A note on Automatic Baire property
by: Staiger, Ludwig
Published: (2025)
by: Staiger, Ludwig
Published: (2025)
Dissecting power of intersection of two context-free languages
by: Rukavicka, Josef
Published: (2020)
by: Rukavicka, Josef
Published: (2020)
Rational cross-sections, bounded generation and orders on groups
by: Bodart, Corentin
Published: (2022)
by: Bodart, Corentin
Published: (2022)
A fast algorithm for Stallings foldings over virtually free groups
by: Cookson, Sam, et al.
Published: (2023)
by: Cookson, Sam, et al.
Published: (2023)
Decision Problems on Copying and Shuffling
by: Halava, Vesa, et al.
Published: (2023)
by: Halava, Vesa, et al.
Published: (2023)
Quaternionic lattices and poly-context-free word problem
by: Bondarenko, Ievgen
Published: (2024)
by: Bondarenko, Ievgen
Published: (2024)
On the complexity of epimorphism testing with virtually abelian targets
by: Elder, Murray, et al.
Published: (2025)
by: Elder, Murray, et al.
Published: (2025)
Eve-positional languages: putting order into Büchi automata
by: Idir, Olivier
Published: (2026)
by: Idir, Olivier
Published: (2026)
Decomposition of Automata recognizing Ideals
by: Berry, Mathias, et al.
Published: (2026)
by: Berry, Mathias, et al.
Published: (2026)
Deterministic Suffix-reading Automata
by: Keerthan, R, et al.
Published: (2025)
by: Keerthan, R, et al.
Published: (2025)
On universality of regular realizability problems
by: Rubtsov, Alexander, et al.
Published: (2023)
by: Rubtsov, Alexander, et al.
Published: (2023)
Learning Automata with Name Allocation
by: Frank, Florian, et al.
Published: (2025)
by: Frank, Florian, et al.
Published: (2025)
Alternating Nominal Automata with Name Allocation
by: Frank, Florian, et al.
Published: (2024)
by: Frank, Florian, et al.
Published: (2024)
Deciding Sparseness of Regular Languages of Finite Trees and Infinite Words
by: Eickmeyer, Kord, et al.
Published: (2025)
by: Eickmeyer, Kord, et al.
Published: (2025)
List of Results on the Černý Conjecture and Reset Thresholds for Synchronizing Automata
by: Volkov, Mikhail V.
Published: (2025)
by: Volkov, Mikhail V.
Published: (2025)
Hypernode Automata
by: Bartocci, Ezio, et al.
Published: (2023)
by: Bartocci, Ezio, et al.
Published: (2023)
Using games and universal trees to characterise the nondeterministic index of tree languages
by: Idir, Olivier, et al.
Published: (2025)
by: Idir, Olivier, et al.
Published: (2025)
Nominal Tree Automata With Name Allocation
by: Prucker, Simon, et al.
Published: (2024)
by: Prucker, Simon, et al.
Published: (2024)
An algebraic characterisation of Eve-positional languages
by: Colcombet, Thomas, et al.
Published: (2026)
by: Colcombet, Thomas, et al.
Published: (2026)
Similar Items
-
Subsets of groups with context-free preimages
by: Levine, Alex
Published: (2023) -
On groups with EDT0L word problem
by: Bishop, Alex, et al.
Published: (2025) -
Permutation closure for multiple context-free languages
by: Duncan, Andrew, et al.
Published: (2025) -
The word problem and growth of groups
by: Bondarenko, Ievgen
Published: (2024) -
The Freeness Problem for Automaton Semigroups
by: D'Angeli, Daniele, et al.
Published: (2024)