On groups with EDT0L word problem.
CoRR, May, 2025
On the complexity of epimorphism testing with virtually abelian targets.
CoRR, January, 2025
Finite groups with geodetic Cayley graphs.
CoRR, 2024
On k-geodetic graphs and groups.
Int. J. Algebra Comput., September, 2023
Rewriting systems, plain groups, and geodetic graphs.
Theor. Comput. Sci., 2022
On the geometry of Cayley automatic groups.
Int. J. Algebra Comput., 2022
Cayley polynomial-time computable groups.
Inf. Comput., 2022
The Isomorphism Problem for Plain Groups Is in Σ₃<sup>𝖯</sup>.
Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022
The isomorphism problem for plain groups is in Σ<sub>3</sub><sup>P</sup>.
CoRR, 2021
Detecting plainness in PSPACE.
CoRR, 2021
$k$-Pop Stack Sortable Permutations and $2$-Avoidance.
Electron. J. Comb., 2021
Solutions to twisted word equations and equations in virtually free groups.
Int. J. Algebra Comput., 2020
The complexity of solution sets to equations in hyperbolic groups.
CoRR, 2020
Sub-dominant Cogrowth Behavior and the Viability of Deciding Amenability Numerically.
Exp. Math., 2019
Bounded Automata Groups are co-ET0L.
Proceedings of the Language and Automata Theory and Applications, 2019
Solutions Sets to Systems of Equations in Hyperbolic Groups Are EDT0L in PSPACE.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019
Applications of L systems to group theory.
Int. J. Algebra Comput., 2018
Permutations Sorted by a Finite and an Infinite Stack in Series.
Proceedings of the Language and Automata Theory and Applications, 2018
Solutions of Twisted Word Equations, EDT0L Languages, and Context-Free Groups.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017
2-manifold recognition is in logspace.
J. Comput. Geom., 2016
Solution sets for equations over free groups are EDT0L languages.
Int. J. Algebra Comput., 2016
Thompson's group F is 1-counter graph automatic.
Groups Complex. Cryptol., 2016
Permutations of context-free, ET0L and indexed languages.
Discret. Math. Theor. Comput. Sci., 2016
Metric properties of Baumslag-Solitar groups.
Int. J. Algebra Comput., 2015
Random Sampling of Trivial Words in Finitely Presented Groups.
Exp. Math., 2015
Permutations Generated by a Depth 2 Stack and an Infinite Stack in Series are Algebraic.
Electron. J. Comb., 2015
The cogrowth series for BS(N, N) is D-finite.
Int. J. Algebra Comput., 2014
Permutations of context-free and indexed languages.
CoRR, 2014
$\mathcal C$-graph automatic groups.
CoRR, 2013
Logspace computations for Garside groups of spindle type.
CoRR, 2013
On Groups whose Geodesic Growth is Polynomial.
Int. J. Algebra Comput., 2012
On the cogrowth of Thompson's group F.
Groups Complex. Cryptol., 2012
On groups that have normal forms computable in logspace
CoRR, 2012
Some geodesic problems in groups.
Groups Complex. Cryptol., 2010
On Groups and Counter Automata.
Int. J. Algebra Comput., 2008
Permutations Generated by a Stack of Depth 2 and an Infinite Stack in Series.
Electron. J. Comb., 2006
On the Stanley-Wilf limit of 4231-avoiding permutations and a conjecture of Arratia.
Adv. Appl. Math., 2006
A context-free and a 1-counter geodesic language for a Baumslag-Solitar group.
Theor. Comput. Sci., 2005
Patterns Theory and Geodesic Automatic Structure for a Class of Groups.
Int. J. Algebra Comput., 2003
Curvature Testing in 3-Dimensional Metric Polyhedral Complexes.
Exp. Math., 2002