Simon Beier

15 papers C 4Journal 5Unranked 5
YearRankTypeTitle / Venue / Authors
2024 — conf
On Regular Expression Proof Complexity of Salomaa's Axiom System F
Taming the Infinities of Concurrency
Simon Beier, Markus Holzer
2022 J jnl
Nondeterministic right one-way jumping finite automata.
Inf. Comput.
Simon Beier, Markus Holzer
2020 J jnl
Decidability of Right One-Way Jumping Finite Automata.
Int. J. Found. Comput. Sci.
Simon Beier, Markus Holzer
2020 — —
New results on semilinear sets and variants of jumping finite automata.
Simon Beier
2019 — conf
Nondeterministic Right One-Way Jumping Finite Automata (Extended Abstract).
DCFS
Simon Beier, Markus Holzer
2019 J jnl
Operational State Complexity and Decidability of Jumping Finite Automata.
Int. J. Found. Comput. Sci.
Simon Beier, Markus Holzer, Martin Kutrib
2019 J jnl
Properties of right one-way jumping finite automata.
Theor. Comput. Sci.
Simon Beier, Markus Holzer
2019 C conf
Semi-linear Lattices and Right One-Way Jumping Finite Automata (Extended Abstract).
CIAA
Simon Beier, Markus Holzer
2018 C conf
Decidability of Right One-Way Jumping Finite Automata.
DLT
Simon Beier, Markus Holzer
2018 J jnl
Diving into the queue.
RAIRO Theor. Informatics Appl.
Simon Beier, Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2018 — conf
Properties of Right One-Way Jumping Finite Automata.
DCFS
Simon Beier, Markus Holzer
2017 C conf
On Regular Expression Proof Complexity.
DLT
Simon Beier, Markus Holzer
2017 — conf
On the Descriptional Complexity of Operations on Semilinear Sets.
AFL
Simon Beier, Markus Holzer, Martin Kutrib
2017 C conf
Operational State Complexity and Decidability of Jumping Finite Automata.
DLT
Simon Beier, Markus Holzer, Martin Kutrib
2016 — conf
Diving into the queue.
NCMA
Simon Beier, Martin Kutrib, Andreas Malcher, Matthias Wendlandt