https://ogma.newcastle.edu.au/vital/access/ /manager/Index ${session.getAttribute("locale")} 5 Permutations of context-free, ET0L and indexed languages https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:24663 Tue 10 Mar 2020 11:56:31 AEDT ]]> Solution sets for equations over free groups are EDT0L languages https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:21496 i≤sFi, where each Fi is either a free or finite group, or a free monoid with involution. In all cases the result is the same: the set of all solutions in reduced words is EDT0L. This was known only for quadratic word equations by, which is a very restricted case. Our general result became possible due to the recent recompression technique of Jeż. In this paper we use a new method to integrate solutions of linear Diophantine equations into the process and obtain more general results than in the related paper. For example, we improve the complexity from quadratic nondeterministic space in to quasi-linear nondeterministic space here. This implies an improved complexity for deciding the existential theory of non-abelian free groups: NSPACE(n log n). The conjectured complexity is NP, however, we believe that our results are optimal with respect to space complexity, independent of the conjectured NP.]]> Thu 26 Sep 2024 10:18:13 AEST ]]> Solution sets for equations over free groups are EDT0L languages https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:24664 Thu 17 Oct 2024 14:58:42 AEDT ]]> Applications of L systems to group theory https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:48744 Mon 17 Apr 2023 13:56:08 AEST ]]>