On Regular Expression Proof Complexity. - Simon Beier; Markus Holzer 001 (DLT, 2017)

On the Descriptional Complexity of Operations on Semilinear Sets. - Simon Beier; Markus Holzer 001; Martin Kutrib (AFL, 2017)

Diving into the queue. - Simon Beier; Martin Kutrib; Andreas Malcher; Matthias Wendlandt (RAIRO Theor. Informatics Appl., 2018)

Nondeterministic Right One-Way Jumping Finite Automata (Extended Abstract). - Simon Beier; Markus Holzer 001 (DCFS, 2019)

Semi-linear Lattices and Right One-Way Jumping Finite Automata (Extended Abstract). - Simon Beier; Markus Holzer 001 (CIAA, 2019)

Operational State Complexity and Decidability of Jumping Finite Automata. - Simon Beier; Markus Holzer 001; Martin Kutrib (Int. J. Found. Comput. Sci., 2019)

Properties of right one-way jumping finite automata. - Simon Beier; Markus Holzer 001 (Theor. Comput. Sci., 2019)

Decidability of Right One-Way Jumping Finite Automata. - Simon Beier; Markus Holzer 001 (Int. J. Found. Comput. Sci., 2020)

New results on semilinear sets and variants of jumping finite automata. - Simon Beier (Logos Verlag Berlin, 2020)

Nondeterministic right one-way jumping finite automata. - Simon Beier; Markus Holzer 001 (Inf. Comput., 2022)

On Regular Expression Proof Complexity of Salomaa's Axiom System F1. - Simon Beier; Markus Holzer 001 (Taming the Infinities of Concurrency, 2024)