Simon Beier

According to our database, Simon Beier authored at least 11 papers between 2017 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

On Regular Expression Proof Complexity of Salomaa's Axiom System F₁.

Simon Beier, Markus Holzer

Proceedings of the Taming the Infinities of Concurrency, 2024

2022

Nondeterministic right one-way jumping finite automata.

Simon Beier, Markus Holzer

Inf. Comput., 2022

2020

New results on semilinear sets and variants of jumping finite automata.

Simon Beier

PhD thesis, 2020

Decidability of Right One-Way Jumping Finite Automata.

Simon Beier, Markus Holzer

Int. J. Found. Comput. Sci., 2020

2019

Properties of right one-way jumping finite automata.

Simon Beier, Markus Holzer

Theor. Comput. Sci., 2019

Operational State Complexity and Decidability of Jumping Finite Automata.

Simon Beier, Markus Holzer, Martin Kutrib

Int. J. Found. Comput. Sci., 2019

Semi-linear Lattices and Right One-Way Jumping Finite Automata (Extended Abstract).

Simon Beier, Markus Holzer

Proceedings of the Implementation and Application of Automata, 2019

Nondeterministic Right One-Way Jumping Finite Automata (Extended Abstract).

Simon Beier, Markus Holzer

Proceedings of the Descriptional Complexity of Formal Systems, 2019

2018

Diving into the queue.

Simon Beier, Martin Kutrib, Andreas Malcher, Matthias Wendlandt

RAIRO Theor. Informatics Appl., 2018

2017

On the Descriptional Complexity of Operations on Semilinear Sets.

Simon Beier, Markus Holzer, Martin Kutrib

Proceedings of the Proceedings 15th International Conference on Automata and Formal Languages, 2017

On Regular Expression Proof Complexity.

Simon Beier, Markus Holzer

Proceedings of the Developments in Language Theory - 21st International Conference, 2017