Parallel algorithms for power circuits and the word problem of the Baumslag group. Computational complexity, (32)2:10, Springer, 2023. [PUMA: f2023 hybrid oa oafonds transform ubs_10005 ubs_20008 ubs_30080 ubs_40107 unibibliografie wos]
Groups with ALOGTIME-hard Word Problems and PSPACE-complete Compressed Word Problems. ACM transactions on computation theory, (14)3-4:1-41, Association for Computing Machinery, 2023. [PUMA: ubs_10005 ubs_20008 ubs_30080 ubs_40107 unibibliografie wos]
The Power Word Problem in Graph Products. In Volker Diekert, und Mikhail Volkov (Hrsg.), Developments in Language Theory, 13257:286-298, Springer, Cham, 2022. [PUMA: ubs_10005 ubs_20008 ubs_30080 ubs_40107 unibibliografie wos]
Properties of graphs specified by a regular language. Acta informatica, (59)4:357-385, Springer, 2022. [PUMA: oa ubs_10005 ubs_20008 ubs_30080 ubs_40107 unibibliografie wos]
Equation Satisfiability in Solvable Groups. Theory of computing systems, Springer, 2022. [PUMA: ubs_10005 ubs_20008 ubs_30080 ubs_40107 unibibliografie wos]
Parallel complexity for nilpotent groups. International journal of algebra and computation, (32)05:895-928, World Scientific Publishing, 2022. [PUMA: ubs_10005 ubs_20008 ubs_30080 ubs_40107 unibibliografie wos]
An Automaton Group with PSPACE-Complete Word Problem. Theory of computing systems, Springer, 2022. [PUMA: oa ubs_10005 ubs_20008 ubs_30080 ubs_40107 unibibliografie wos]
Regular matching problems for infinite trees. Logical methods in computer science, (18)1:25, Department of Theoretical Computer Science, Technical University of Braunschweig, 2022. [PUMA: ubs_10005 ubs_20008 ubs_30080 ubs_40107 unibibliografie wos]
Replication Data for: The Method of Forced Probabilities: a Computation Trick for Bayesian Model Evidence : MFP implementation codes on SIP. 2022. [PUMA: darus mult ubs_10005 ubs_10021 ubs_20008 ubs_20019 ubs_30080 ubs_30165 ubs_40107 unibibliografie]
On the Average Case of MergeInsertion. Theory of computing systems, (64)7:1197-1224, Springer, 2020. [PUMA: oa ubs_10005 ubs_20008 ubs_30080 ubs_40107 unibibliografie wos]
Solutions to twisted word equations and equations in virtually free groups. International journal of algebra and computation, (30)4:731-819, World Scientific Publishing, 2020. [PUMA: ubs_10005 ubs_20008 ubs_30080 ubs_40107 unibibliografie wos]
On the structure theory of partial automaton semigroups. Semigroup Forum, (101):51-76, Springer Nature, 2020. [PUMA: ubs_10005 ubs_20008 ubs_30080 ubs_40107 unibibliografie wos]
Infinite automaton semigroups and groups have infinite orbits. Journal of Algebra, (553):119-137, Elsevier, 2020. [PUMA: ubs_10005 ubs_20008 ubs_30080 ubs_40107 unibibliografie wos]
Melt spinning of propylene carbonate-plasticized poly(acrylonitrile)-co-poly(methyl acrylate). Polymers for Advanced Technologies, (31)8:1827-1835, Wiley, 2020. [PUMA: mult oa ubs_10003 ubs_10005 ubs_20003 ubs_20008 ubs_30036 ubs_30080 ubs_40064 ubs_40107 unibibliografie wos]
Orbit expandability of automaton semigroups and groups. Theoretical Computer Science, (809):418-429, Elsevier, 2020. [PUMA: ubs_10005 ubs_20008 ubs_30080 ubs_40107 unibibliografie wos]
Automaton semigroups and groups : On the undecidability of problems related to freeness and finiteness. Israel Journal of Mathematics, (237):15–52, Springer, 2020. [PUMA: ubs_10005 ubs_20008 ubs_30080 ubs_40107 unibibliografie wos]
Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem. In Kazuhiro Yokoyama, Steve Linton, und Daniel Robertz (Hrsg.), ISSAC'15 : proceedings of the 40th International Symposium on Symbolic and Algebraic Computation, 141-148, ACM, New York, NY, 2015. [PUMA: hp ubs_10005 ubs_20008 ubs_30080 ubs_40107 unibibliografie]
Equations over free inverse monoids with idempotent variables. In Lev D. Beklemishev, und Daniil V. Musatov (Hrsg.), Computer science - theory and applications : 10th International Computer Science Symposium, 9139:173-188, Springer, Cham, 2015. [PUMA: hp ubs_10005 ubs_20008 ubs_30080 ubs_40107 unibibliografie]
Efficient algorithms for morphisms over omega-regular languages. In Prahladh Harsha, und G. Ramalingam (Hrsg.), 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015), 45:112-124, Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Wadern, 2015. [PUMA: hp ubs_10005 ubs_20008 ubs_30080 ubs_40107 unibibliografie]
Solution sets for equations over free groups are EDT0L languages. In Magnús M. Halldórsson, Kazuo Iwama, Naoki Kobayashi, und Bettina Speckmann (Hrsg.), Automata, Languages, and Programming : 42nd International Colloquium, ICALP 2015 : proceedings, (2)9135:134-145, Springer, Berlin, 2015. [PUMA: hp ubs_10005 ubs_20008 ubs_30080 ubs_40107 unibibliografie]