Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Simon Beier

dblp:185/0479 · DBLP profile ↗
← Back
6ranked-venue papers
6as first author
1since 2021 · last 2022
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 6 · 6 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Automata and formal languages · 100%

Topics — the 1 heaviest of 1, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Automata and formal languages › finite automata
jumping automata
0.612022
Nondeterministic right one-way jumping finite automata · Inf. Comput. 2022
YearPublicationVenuePosition
2022 Nondeterministic right one-way jumping finite automata
Simon Beier, Markus Holzer 0001
Inf. Comput.1
2019 Semi-linear Lattices and Right One-Way Jumping Finite Automata (Extended Abstract)
Simon Beier, Markus Holzer 0001
CIAA1
2019 Properties of right one-way jumping finite automata
Simon Beier, Markus Holzer 0001
Theor. Comput. Sci.1
2018 Decidability of Right One-Way Jumping Finite Automata
Simon Beier, Markus Holzer 0001
DLT1
2017 On Regular Expression Proof Complexity
Simon Beier, Markus Holzer 0001
DLT1
2017 Operational State Complexity and Decidability of Jumping Finite Automata
Simon Beier, Markus Holzer 0001, Martin Kutrib
DLT1