A Aralex Aachen research explorer

Search

From

To

Institution

Field

Type

Topic: semigroups and automata theory ×

Open access only Cited by patents (Lens) Include non-Aachen papers (citing/cited)

Papers matching “regularity problem” in semigroups and automata theory 6

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

Not finding it? Sign in to also search OpenAlex live.

Saturation Problems for Families of Automata
2025 arXiv (Cornell University) preprint Computer Science semigroups and automata theory Open access

León Bohn, Christof Löding, Sven Schewe

0

citations
Saturation Problems for Families of Automata
2025 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science semigroups and automata theory Open access

0

citations
Computing $$\textit{pre}^{*}$$ for General Context Free Grammars
2024 Lecture notes in computer science conference-paper Computer Science semigroups and automata theory

Peter Rossmanith

0

citations
Projection for Büchi Tree Automata with Constraints between Siblings
2020 International Journal of Foundations of Computer Science article Computer Science semigroups and automata theory

Patrick Landwehr, Christof Löding

0

citations
On the Boolean Closure of Deterministic Top-Down Tree Automata
2023 International Journal of Foundations of Computer Science article Computer Science semigroups and automata theory Open access

Christof Löding, Wolfgang Thomas

0

citations
Resynchronized Uniformization and Definability Problems for Rational Relations
2023 Discrete Mathematics & Theoretical Computer Science article Computer Science semigroups and automata theory Open access

Christof Löding, Sarah Winter

0

citations

6 results